./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d316a7ba22efd80f1b38cf51bd9ff0ce90b0827d98cb289348ffc09e69061f8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:07:53,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:07:53,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:07:53,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:07:53,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:07:53,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:07:53,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:07:53,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:07:53,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:07:53,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:07:53,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:07:53,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:07:53,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:07:53,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:07:53,953 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:07:53,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:07:53,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:07:53,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:07:53,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:07:53,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:07:53,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:07:53,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:07:53,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:07:53,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:07:53,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:07:53,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:07:53,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:07:53,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:07:53,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:07:53,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:07:53,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:07:53,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:07:53,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:07:53,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:07:53,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:07:53,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:07:53,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:07:53,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:07:53,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:07:53,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:07:53,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:07:53,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:07:53,965 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d316a7ba22efd80f1b38cf51bd9ff0ce90b0827d98cb289348ffc09e69061f8 [2024-10-14 05:07:54,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:07:54,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:07:54,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:07:54,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:07:54,279 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:07:54,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-10-14 05:07:55,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:07:56,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:07:56,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-10-14 05:07:56,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b81b4a7dd/07b6d3f7a6f84ec49bb9614b0abc7a86/FLAGa0ed77f1d [2024-10-14 05:07:56,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b81b4a7dd/07b6d3f7a6f84ec49bb9614b0abc7a86 [2024-10-14 05:07:56,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:07:56,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:07:56,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:07:56,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:07:56,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:07:56,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:07:56" (1/1) ... [2024-10-14 05:07:56,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214ac19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:56, skipping insertion in model container [2024-10-14 05:07:56,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:07:56" (1/1) ... [2024-10-14 05:07:56,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:07:56,756 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c[26888,26901] [2024-10-14 05:07:56,790 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c[29705,29718] [2024-10-14 05:07:57,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:07:57,467 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:07:57,518 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c[26888,26901] [2024-10-14 05:07:57,527 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c[29705,29718] [2024-10-14 05:07:57,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:07:57,980 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:07:57,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57 WrapperNode [2024-10-14 05:07:57,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:07:57,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:07:57,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:07:57,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:07:57,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,356 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-10-14 05:07:58,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:07:58,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:07:58,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:07:58,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:07:58,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,644 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-14 05:07:58,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:58,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:59,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:07:59,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:07:59,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:07:59,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:07:59,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (1/1) ... [2024-10-14 05:07:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:07:59,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:07:59,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:07:59,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:07:59,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:07:59,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:07:59,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:07:59,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:07:59,452 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:07:59,454 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:08:04,150 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-14 05:08:04,150 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:08:04,238 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:08:04,238 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 05:08:04,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:08:04 BoogieIcfgContainer [2024-10-14 05:08:04,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:08:04,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:08:04,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:08:04,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:08:04,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:07:56" (1/3) ... [2024-10-14 05:08:04,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f74e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:08:04, skipping insertion in model container [2024-10-14 05:08:04,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:57" (2/3) ... [2024-10-14 05:08:04,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f74e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:08:04, skipping insertion in model container [2024-10-14 05:08:04,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:08:04" (3/3) ... [2024-10-14 05:08:04,249 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-10-14 05:08:04,268 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:08:04,268 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:08:04,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:08:04,369 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;@d5e9e8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:08:04,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:08:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 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-14 05:08:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 05:08:04,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:04,390 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] [2024-10-14 05:08:04,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:04,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1926784474, now seen corresponding path program 1 times [2024-10-14 05:08:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240501821] [2024-10-14 05:08:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:04,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:04,695 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-14 05:08:04,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:04,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240501821] [2024-10-14 05:08:04,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240501821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:04,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:04,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 05:08:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955555475] [2024-10-14 05:08:04,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:04,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 05:08:04,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:04,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 05:08:04,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 05:08:04,736 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-14 05:08:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:04,829 INFO L93 Difference]: Finished difference Result 1702 states and 3341 transitions. [2024-10-14 05:08:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 05:08:04,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2024-10-14 05:08:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:04,867 INFO L225 Difference]: With dead ends: 1702 [2024-10-14 05:08:04,867 INFO L226 Difference]: Without dead ends: 880 [2024-10-14 05:08:04,877 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-14 05:08:04,881 INFO L432 NwaCegarLoop]: 1663 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:04,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1663 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-14 05:08:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-14 05:08:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8952164009111618) internal successors, (1664), 879 states have internal predecessors, (1664), 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-14 05:08:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1664 transitions. [2024-10-14 05:08:04,976 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1664 transitions. Word has length 23 [2024-10-14 05:08:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:04,976 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1664 transitions. [2024-10-14 05:08:04,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-14 05:08:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1664 transitions. [2024-10-14 05:08:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 05:08:04,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:04,978 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] [2024-10-14 05:08:04,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:08:04,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:04,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash 199933740, now seen corresponding path program 1 times [2024-10-14 05:08:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904195348] [2024-10-14 05:08:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:05,250 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-14 05:08:05,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:05,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904195348] [2024-10-14 05:08:05,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904195348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:05,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:05,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 05:08:05,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645861193] [2024-10-14 05:08:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:05,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:05,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:05,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:05,255 INFO L87 Difference]: Start difference. First operand 880 states and 1664 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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-14 05:08:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:08,539 INFO L93 Difference]: Finished difference Result 2384 states and 4537 transitions. [2024-10-14 05:08:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:08,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2024-10-14 05:08:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:08,548 INFO L225 Difference]: With dead ends: 2384 [2024-10-14 05:08:08,548 INFO L226 Difference]: Without dead ends: 1631 [2024-10-14 05:08:08,551 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-14 05:08:08,552 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 998 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:08,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 769 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 05:08:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-10-14 05:08:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-10-14 05:08:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.5782688766114181) internal successors, (2571), 1630 states have internal predecessors, (2571), 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-14 05:08:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2571 transitions. [2024-10-14 05:08:08,643 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2571 transitions. Word has length 23 [2024-10-14 05:08:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:08,644 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2571 transitions. [2024-10-14 05:08:08,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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-14 05:08:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2571 transitions. [2024-10-14 05:08:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 05:08:08,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:08,646 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] [2024-10-14 05:08:08,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:08:08,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:08,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash 143558005, now seen corresponding path program 1 times [2024-10-14 05:08:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:08,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764182082] [2024-10-14 05:08:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:08,824 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-14 05:08:08,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764182082] [2024-10-14 05:08:08,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764182082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:08,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:08,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:08:08,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036083380] [2024-10-14 05:08:08,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:08,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:08:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:08:08,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:08:08,827 INFO L87 Difference]: Start difference. First operand 1631 states and 2571 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-14 05:08:08,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:08,924 INFO L93 Difference]: Finished difference Result 1695 states and 2673 transitions. [2024-10-14 05:08:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:08:08,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-10-14 05:08:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:08,932 INFO L225 Difference]: With dead ends: 1695 [2024-10-14 05:08:08,932 INFO L226 Difference]: Without dead ends: 1631 [2024-10-14 05:08:08,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:08:08,934 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 0 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:08,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4918 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:08:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-10-14 05:08:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-10-14 05:08:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.5408225905463475) internal successors, (2510), 1630 states have internal predecessors, (2510), 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-14 05:08:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2510 transitions. [2024-10-14 05:08:08,979 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2510 transitions. Word has length 27 [2024-10-14 05:08:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:08,979 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2510 transitions. [2024-10-14 05:08:08,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-14 05:08:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2510 transitions. [2024-10-14 05:08:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 05:08:08,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:08,984 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] [2024-10-14 05:08:08,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:08:08,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:08,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1723189211, now seen corresponding path program 1 times [2024-10-14 05:08:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:08,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964233833] [2024-10-14 05:08:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:08,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:09,385 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-14 05:08:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:09,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964233833] [2024-10-14 05:08:09,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964233833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:09,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:09,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:09,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64088147] [2024-10-14 05:08:09,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:09,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:09,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:09,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:09,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:09,388 INFO L87 Difference]: Start difference. First operand 1631 states and 2510 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-14 05:08:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:09,974 INFO L93 Difference]: Finished difference Result 2607 states and 4094 transitions. [2024-10-14 05:08:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 05:08:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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 87 [2024-10-14 05:08:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:09,987 INFO L225 Difference]: With dead ends: 2607 [2024-10-14 05:08:09,987 INFO L226 Difference]: Without dead ends: 2546 [2024-10-14 05:08:09,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-14 05:08:09,994 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 13544 mSDsluCounter, 3889 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13544 SdHoareTripleChecker+Valid, 5483 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:09,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13544 Valid, 5483 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 05:08:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-10-14 05:08:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1690. [2024-10-14 05:08:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.5438388625592416) internal successors, (2606), 1689 states have internal predecessors, (2606), 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-14 05:08:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2606 transitions. [2024-10-14 05:08:10,045 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2606 transitions. Word has length 87 [2024-10-14 05:08:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:10,046 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2606 transitions. [2024-10-14 05:08:10,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-14 05:08:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2606 transitions. [2024-10-14 05:08:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 05:08:10,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:10,048 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] [2024-10-14 05:08:10,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:08:10,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:10,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:10,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1732338517, now seen corresponding path program 1 times [2024-10-14 05:08:10,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:10,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732251642] [2024-10-14 05:08:10,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:10,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:10,220 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-14 05:08:10,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:10,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732251642] [2024-10-14 05:08:10,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732251642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:10,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:10,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:10,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194633016] [2024-10-14 05:08:10,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:10,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:10,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:10,224 INFO L87 Difference]: Start difference. First operand 1690 states and 2606 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-14 05:08:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:10,275 INFO L93 Difference]: Finished difference Result 1919 states and 2977 transitions. [2024-10-14 05:08:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:10,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2024-10-14 05:08:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:10,284 INFO L225 Difference]: With dead ends: 1919 [2024-10-14 05:08:10,284 INFO L226 Difference]: Without dead ends: 1799 [2024-10-14 05:08:10,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:10,286 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 1506 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:10,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1687 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-14 05:08:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1795. [2024-10-14 05:08:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.54712771890686) internal successors, (2774), 1794 states have internal predecessors, (2774), 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-14 05:08:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2774 transitions. [2024-10-14 05:08:10,328 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2774 transitions. Word has length 89 [2024-10-14 05:08:10,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:10,329 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2774 transitions. [2024-10-14 05:08:10,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-14 05:08:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2774 transitions. [2024-10-14 05:08:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 05:08:10,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:10,331 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] [2024-10-14 05:08:10,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:08:10,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:10,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1734483469, now seen corresponding path program 1 times [2024-10-14 05:08:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:10,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178639251] [2024-10-14 05:08:10,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:10,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:11,045 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-14 05:08:11,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178639251] [2024-10-14 05:08:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178639251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:11,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:11,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278750351] [2024-10-14 05:08:11,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:11,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:11,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:11,051 INFO L87 Difference]: Start difference. First operand 1795 states and 2774 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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-14 05:08:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:11,606 INFO L93 Difference]: Finished difference Result 2022 states and 3138 transitions. [2024-10-14 05:08:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:08:11,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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 89 [2024-10-14 05:08:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:11,615 INFO L225 Difference]: With dead ends: 2022 [2024-10-14 05:08:11,615 INFO L226 Difference]: Without dead ends: 1797 [2024-10-14 05:08:11,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:08:11,617 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 6112 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6112 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:11,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6112 Valid, 2264 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:08:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2024-10-14 05:08:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1795. [2024-10-14 05:08:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.5460122699386503) internal successors, (2772), 1794 states have internal predecessors, (2772), 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-14 05:08:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2772 transitions. [2024-10-14 05:08:11,668 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2772 transitions. Word has length 89 [2024-10-14 05:08:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:11,668 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2772 transitions. [2024-10-14 05:08:11,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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-14 05:08:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2772 transitions. [2024-10-14 05:08:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 05:08:11,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:11,671 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] [2024-10-14 05:08:11,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:08:11,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:11,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2100477793, now seen corresponding path program 1 times [2024-10-14 05:08:11,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:11,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454618652] [2024-10-14 05:08:11,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:11,958 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-14 05:08:11,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454618652] [2024-10-14 05:08:11,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454618652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:11,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:11,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:08:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214420843] [2024-10-14 05:08:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:11,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:08:11,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:11,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:08:11,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:08:11,960 INFO L87 Difference]: Start difference. First operand 1795 states and 2772 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-14 05:08:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:12,015 INFO L93 Difference]: Finished difference Result 1801 states and 2779 transitions. [2024-10-14 05:08:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:08:12,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 90 [2024-10-14 05:08:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:12,023 INFO L225 Difference]: With dead ends: 1801 [2024-10-14 05:08:12,024 INFO L226 Difference]: Without dead ends: 1799 [2024-10-14 05:08:12,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:08:12,025 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4789 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:12,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4789 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-14 05:08:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2024-10-14 05:08:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1797 states have (on average 1.5442404006677797) internal successors, (2775), 1798 states have internal predecessors, (2775), 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-14 05:08:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2775 transitions. [2024-10-14 05:08:12,071 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2775 transitions. Word has length 90 [2024-10-14 05:08:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:12,072 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2775 transitions. [2024-10-14 05:08:12,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-14 05:08:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2775 transitions. [2024-10-14 05:08:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:12,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:12,074 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] [2024-10-14 05:08:12,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:08:12,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:12,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash -728003923, now seen corresponding path program 1 times [2024-10-14 05:08:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:12,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102893283] [2024-10-14 05:08:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:12,187 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-14 05:08:12,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102893283] [2024-10-14 05:08:12,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102893283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:12,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:12,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774740665] [2024-10-14 05:08:12,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:12,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:12,190 INFO L87 Difference]: Start difference. First operand 1799 states and 2775 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:12,235 INFO L93 Difference]: Finished difference Result 2241 states and 3475 transitions. [2024-10-14 05:08:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:12,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-10-14 05:08:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:12,243 INFO L225 Difference]: With dead ends: 2241 [2024-10-14 05:08:12,243 INFO L226 Difference]: Without dead ends: 2012 [2024-10-14 05:08:12,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:12,245 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 1525 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:12,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2024-10-14 05:08:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 2010. [2024-10-14 05:08:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 2008 states have (on average 1.546812749003984) internal successors, (3106), 2009 states have internal predecessors, (3106), 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-14 05:08:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 3106 transitions. [2024-10-14 05:08:12,292 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 3106 transitions. Word has length 91 [2024-10-14 05:08:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:12,292 INFO L471 AbstractCegarLoop]: Abstraction has 2010 states and 3106 transitions. [2024-10-14 05:08:12,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 3106 transitions. [2024-10-14 05:08:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:12,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:12,294 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] [2024-10-14 05:08:12,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:08:12,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:12,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash 27380141, now seen corresponding path program 1 times [2024-10-14 05:08:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:12,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941204803] [2024-10-14 05:08:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:12,387 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-14 05:08:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941204803] [2024-10-14 05:08:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941204803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130298432] [2024-10-14 05:08:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:12,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:12,389 INFO L87 Difference]: Start difference. First operand 2010 states and 3106 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:12,445 INFO L93 Difference]: Finished difference Result 2858 states and 4440 transitions. [2024-10-14 05:08:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:12,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-10-14 05:08:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:12,455 INFO L225 Difference]: With dead ends: 2858 [2024-10-14 05:08:12,455 INFO L226 Difference]: Without dead ends: 2418 [2024-10-14 05:08:12,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:12,458 INFO L432 NwaCegarLoop]: 1673 mSDtfsCounter, 1523 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:12,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2024-10-14 05:08:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2416. [2024-10-14 05:08:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2414 states have (on average 1.5476387738193869) internal successors, (3736), 2415 states have internal predecessors, (3736), 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-14 05:08:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3736 transitions. [2024-10-14 05:08:12,517 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3736 transitions. Word has length 91 [2024-10-14 05:08:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:12,517 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3736 transitions. [2024-10-14 05:08:12,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3736 transitions. [2024-10-14 05:08:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:12,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:12,519 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] [2024-10-14 05:08:12,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:08:12,519 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:12,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -651589715, now seen corresponding path program 1 times [2024-10-14 05:08:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:12,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449332544] [2024-10-14 05:08:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:12,617 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-14 05:08:12,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:12,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449332544] [2024-10-14 05:08:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449332544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:12,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:12,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789615168] [2024-10-14 05:08:12,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:12,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:12,619 INFO L87 Difference]: Start difference. First operand 2416 states and 3736 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:12,683 INFO L93 Difference]: Finished difference Result 4044 states and 6274 transitions. [2024-10-14 05:08:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:12,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-10-14 05:08:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:12,696 INFO L225 Difference]: With dead ends: 4044 [2024-10-14 05:08:12,697 INFO L226 Difference]: Without dead ends: 3198 [2024-10-14 05:08:12,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:12,700 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 1519 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:12,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1776 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2024-10-14 05:08:12,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 3196. [2024-10-14 05:08:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 3194 states have (on average 1.5441452723857232) internal successors, (4932), 3195 states have internal predecessors, (4932), 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-14 05:08:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 4932 transitions. [2024-10-14 05:08:12,822 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 4932 transitions. Word has length 91 [2024-10-14 05:08:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:12,822 INFO L471 AbstractCegarLoop]: Abstraction has 3196 states and 4932 transitions. [2024-10-14 05:08:12,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 4932 transitions. [2024-10-14 05:08:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:12,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:12,825 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] [2024-10-14 05:08:12,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:08:12,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:12,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash -611645779, now seen corresponding path program 1 times [2024-10-14 05:08:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:12,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454601682] [2024-10-14 05:08:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:12,916 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-14 05:08:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454601682] [2024-10-14 05:08:12,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454601682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:12,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:12,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501179794] [2024-10-14 05:08:12,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:12,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:12,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:12,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:12,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:12,918 INFO L87 Difference]: Start difference. First operand 3196 states and 4932 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:13,010 INFO L93 Difference]: Finished difference Result 6320 states and 9750 transitions. [2024-10-14 05:08:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:13,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-10-14 05:08:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:13,039 INFO L225 Difference]: With dead ends: 6320 [2024-10-14 05:08:13,039 INFO L226 Difference]: Without dead ends: 4694 [2024-10-14 05:08:13,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:13,048 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 1517 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:13,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2024-10-14 05:08:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 4692. [2024-10-14 05:08:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4692 states, 4690 states have (on average 1.5343283582089553) internal successors, (7196), 4691 states have internal predecessors, (7196), 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-14 05:08:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 7196 transitions. [2024-10-14 05:08:13,179 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 7196 transitions. Word has length 91 [2024-10-14 05:08:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:13,179 INFO L471 AbstractCegarLoop]: Abstraction has 4692 states and 7196 transitions. [2024-10-14 05:08:13,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 7196 transitions. [2024-10-14 05:08:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:13,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:13,181 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] [2024-10-14 05:08:13,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:08:13,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:13,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -348568403, now seen corresponding path program 1 times [2024-10-14 05:08:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247025253] [2024-10-14 05:08:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:13,262 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-14 05:08:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247025253] [2024-10-14 05:08:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247025253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:13,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894407931] [2024-10-14 05:08:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:13,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:13,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:13,265 INFO L87 Difference]: Start difference. First operand 4692 states and 7196 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:13,400 INFO L93 Difference]: Finished difference Result 10680 states and 16318 transitions. [2024-10-14 05:08:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:13,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-10-14 05:08:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:13,418 INFO L225 Difference]: With dead ends: 10680 [2024-10-14 05:08:13,419 INFO L226 Difference]: Without dead ends: 7558 [2024-10-14 05:08:13,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:13,427 INFO L432 NwaCegarLoop]: 1647 mSDtfsCounter, 1513 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:13,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1774 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2024-10-14 05:08:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7556. [2024-10-14 05:08:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7556 states, 7554 states have (on average 1.5181360868414084) internal successors, (11468), 7555 states have internal predecessors, (11468), 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-14 05:08:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7556 states to 7556 states and 11468 transitions. [2024-10-14 05:08:13,670 INFO L78 Accepts]: Start accepts. Automaton has 7556 states and 11468 transitions. Word has length 91 [2024-10-14 05:08:13,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:13,670 INFO L471 AbstractCegarLoop]: Abstraction has 7556 states and 11468 transitions. [2024-10-14 05:08:13,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 7556 states and 11468 transitions. [2024-10-14 05:08:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:13,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:13,673 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] [2024-10-14 05:08:13,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:08:13,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:13,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1237301843, now seen corresponding path program 1 times [2024-10-14 05:08:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987297052] [2024-10-14 05:08:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:13,777 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-14 05:08:13,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:13,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987297052] [2024-10-14 05:08:13,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987297052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:13,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:13,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:13,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737898717] [2024-10-14 05:08:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:13,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:13,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:13,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:13,780 INFO L87 Difference]: Start difference. First operand 7556 states and 11468 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:14,005 INFO L93 Difference]: Finished difference Result 19016 states and 28686 transitions. [2024-10-14 05:08:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:14,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-10-14 05:08:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:14,034 INFO L225 Difference]: With dead ends: 19016 [2024-10-14 05:08:14,034 INFO L226 Difference]: Without dead ends: 13030 [2024-10-14 05:08:14,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:14,048 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 1515 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:14,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13030 states. [2024-10-14 05:08:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13030 to 13028. [2024-10-14 05:08:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13028 states, 13026 states have (on average 1.4970059880239521) internal successors, (19500), 13027 states have internal predecessors, (19500), 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-14 05:08:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13028 states to 13028 states and 19500 transitions. [2024-10-14 05:08:14,499 INFO L78 Accepts]: Start accepts. Automaton has 13028 states and 19500 transitions. Word has length 91 [2024-10-14 05:08:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:14,499 INFO L471 AbstractCegarLoop]: Abstraction has 13028 states and 19500 transitions. [2024-10-14 05:08:14,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13028 states and 19500 transitions. [2024-10-14 05:08:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:14,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:14,501 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] [2024-10-14 05:08:14,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:08:14,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:14,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash -383006547, now seen corresponding path program 1 times [2024-10-14 05:08:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:14,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425721772] [2024-10-14 05:08:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:14,593 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-14 05:08:14,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425721772] [2024-10-14 05:08:14,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425721772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:14,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:14,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975206018] [2024-10-14 05:08:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:14,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:14,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:14,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:14,596 INFO L87 Difference]: Start difference. First operand 13028 states and 19500 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:15,039 INFO L93 Difference]: Finished difference Result 34920 states and 51886 transitions. [2024-10-14 05:08:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:15,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-10-14 05:08:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:15,091 INFO L225 Difference]: With dead ends: 34920 [2024-10-14 05:08:15,091 INFO L226 Difference]: Without dead ends: 23462 [2024-10-14 05:08:15,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:15,116 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 1521 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:15,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1782 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23462 states. [2024-10-14 05:08:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23462 to 23460. [2024-10-14 05:08:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23460 states, 23458 states have (on average 1.4724187910307784) internal successors, (34540), 23459 states have internal predecessors, (34540), 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-14 05:08:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23460 states to 23460 states and 34540 transitions. [2024-10-14 05:08:15,982 INFO L78 Accepts]: Start accepts. Automaton has 23460 states and 34540 transitions. Word has length 91 [2024-10-14 05:08:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:15,982 INFO L471 AbstractCegarLoop]: Abstraction has 23460 states and 34540 transitions. [2024-10-14 05:08:15,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-14 05:08:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 23460 states and 34540 transitions. [2024-10-14 05:08:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 05:08:15,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:15,984 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] [2024-10-14 05:08:15,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:08:15,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:15,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1700611410, now seen corresponding path program 1 times [2024-10-14 05:08:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378466196] [2024-10-14 05:08:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:16,080 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-14 05:08:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378466196] [2024-10-14 05:08:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378466196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:16,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:16,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234858945] [2024-10-14 05:08:16,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:16,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:16,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:16,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:16,083 INFO L87 Difference]: Start difference. First operand 23460 states and 34540 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-14 05:08:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:16,869 INFO L93 Difference]: Finished difference Result 45995 states and 68082 transitions. [2024-10-14 05:08:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:16,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-10-14 05:08:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:16,949 INFO L225 Difference]: With dead ends: 45995 [2024-10-14 05:08:16,949 INFO L226 Difference]: Without dead ends: 33960 [2024-10-14 05:08:16,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:16,977 INFO L432 NwaCegarLoop]: 1680 mSDtfsCounter, 1524 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:16,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1779 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33960 states. [2024-10-14 05:08:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33960 to 33958. [2024-10-14 05:08:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33958 states, 33956 states have (on average 1.4658381434797974) internal successors, (49774), 33957 states have internal predecessors, (49774), 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-14 05:08:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33958 states to 33958 states and 49774 transitions. [2024-10-14 05:08:18,530 INFO L78 Accepts]: Start accepts. Automaton has 33958 states and 49774 transitions. Word has length 93 [2024-10-14 05:08:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:18,532 INFO L471 AbstractCegarLoop]: Abstraction has 33958 states and 49774 transitions. [2024-10-14 05:08:18,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-14 05:08:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 33958 states and 49774 transitions. [2024-10-14 05:08:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 05:08:18,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:18,533 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 05:08:18,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:08:18,534 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:18,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:18,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1969063787, now seen corresponding path program 1 times [2024-10-14 05:08:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:18,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606681071] [2024-10-14 05:08:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 05:08:18,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:18,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606681071] [2024-10-14 05:08:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606681071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:18,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 05:08:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377452458] [2024-10-14 05:08:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:18,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:18,673 INFO L87 Difference]: Start difference. First operand 33958 states and 49774 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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-14 05:08:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:22,191 INFO L93 Difference]: Finished difference Result 36964 states and 54461 transitions. [2024-10-14 05:08:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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 94 [2024-10-14 05:08:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:22,267 INFO L225 Difference]: With dead ends: 36964 [2024-10-14 05:08:22,267 INFO L226 Difference]: Without dead ends: 35460 [2024-10-14 05:08:22,279 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-14 05:08:22,280 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 890 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:22,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 635 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 05:08:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35460 states. [2024-10-14 05:08:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35460 to 35460. [2024-10-14 05:08:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35460 states, 35458 states have (on average 1.4538891082407355) internal successors, (51552), 35459 states have internal predecessors, (51552), 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-14 05:08:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35460 states to 35460 states and 51552 transitions. [2024-10-14 05:08:23,173 INFO L78 Accepts]: Start accepts. Automaton has 35460 states and 51552 transitions. Word has length 94 [2024-10-14 05:08:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:23,174 INFO L471 AbstractCegarLoop]: Abstraction has 35460 states and 51552 transitions. [2024-10-14 05:08:23,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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-14 05:08:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 35460 states and 51552 transitions. [2024-10-14 05:08:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:08:23,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:23,176 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 05:08:23,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:08:23,176 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:23,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1646956380, now seen corresponding path program 1 times [2024-10-14 05:08:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:23,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692733597] [2024-10-14 05:08:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:23,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:23,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692733597] [2024-10-14 05:08:23,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692733597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:23,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:23,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 05:08:23,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837227966] [2024-10-14 05:08:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:23,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:23,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:23,290 INFO L87 Difference]: Start difference. First operand 35460 states and 51552 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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-14 05:08:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:27,272 INFO L93 Difference]: Finished difference Result 41472 states and 59796 transitions. [2024-10-14 05:08:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2024-10-14 05:08:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:27,339 INFO L225 Difference]: With dead ends: 41472 [2024-10-14 05:08:27,340 INFO L226 Difference]: Without dead ends: 38466 [2024-10-14 05:08:27,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-14 05:08:27,352 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 1078 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:27,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 513 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 05:08:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38466 states. [2024-10-14 05:08:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38466 to 38464. [2024-10-14 05:08:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38464 states, 38462 states have (on average 1.4320368155582133) internal successors, (55079), 38463 states have internal predecessors, (55079), 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-14 05:08:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38464 states to 38464 states and 55079 transitions. [2024-10-14 05:08:28,280 INFO L78 Accepts]: Start accepts. Automaton has 38464 states and 55079 transitions. Word has length 100 [2024-10-14 05:08:28,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:28,282 INFO L471 AbstractCegarLoop]: Abstraction has 38464 states and 55079 transitions. [2024-10-14 05:08:28,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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-14 05:08:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38464 states and 55079 transitions. [2024-10-14 05:08:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:08:28,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:28,290 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 05:08:28,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:08:28,291 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:28,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:28,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1717316400, now seen corresponding path program 1 times [2024-10-14 05:08:28,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:28,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719561496] [2024-10-14 05:08:28,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:28,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:08:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:28,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719561496] [2024-10-14 05:08:28,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719561496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:28,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826496201] [2024-10-14 05:08:28,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:28,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:28,605 INFO L87 Difference]: Start difference. First operand 38464 states and 55079 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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-14 05:08:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:33,408 INFO L93 Difference]: Finished difference Result 303954 states and 443056 transitions. [2024-10-14 05:08:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:08:33,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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 115 [2024-10-14 05:08:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:34,150 INFO L225 Difference]: With dead ends: 303954 [2024-10-14 05:08:34,150 INFO L226 Difference]: Without dead ends: 271568 [2024-10-14 05:08:34,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:08:34,238 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 11812 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11812 SdHoareTripleChecker+Valid, 4926 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:34,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11812 Valid, 4926 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:08:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271568 states. [2024-10-14 05:08:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271568 to 70848. [2024-10-14 05:08:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70848 states, 70846 states have (on average 1.4405188719193744) internal successors, (102055), 70847 states have internal predecessors, (102055), 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-14 05:08:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70848 states to 70848 states and 102055 transitions. [2024-10-14 05:08:38,422 INFO L78 Accepts]: Start accepts. Automaton has 70848 states and 102055 transitions. Word has length 115 [2024-10-14 05:08:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:38,423 INFO L471 AbstractCegarLoop]: Abstraction has 70848 states and 102055 transitions. [2024-10-14 05:08:38,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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-14 05:08:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 70848 states and 102055 transitions. [2024-10-14 05:08:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:08:38,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:38,432 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 05:08:38,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:08:38,432 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:38,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash -961932336, now seen corresponding path program 1 times [2024-10-14 05:08:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922424854] [2024-10-14 05:08:38,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:38,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 05:08:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:38,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922424854] [2024-10-14 05:08:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922424854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:38,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:38,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835706412] [2024-10-14 05:08:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:38,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:38,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:38,740 INFO L87 Difference]: Start difference. First operand 70848 states and 102055 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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-14 05:08:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:45,214 INFO L93 Difference]: Finished difference Result 336338 states and 490032 transitions. [2024-10-14 05:08:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:08:45,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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 115 [2024-10-14 05:08:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:45,762 INFO L225 Difference]: With dead ends: 336338 [2024-10-14 05:08:45,763 INFO L226 Difference]: Without dead ends: 303952 [2024-10-14 05:08:45,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:08:45,854 INFO L432 NwaCegarLoop]: 1695 mSDtfsCounter, 11856 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11856 SdHoareTripleChecker+Valid, 4769 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:45,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11856 Valid, 4769 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:08:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303952 states. [2024-10-14 05:08:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303952 to 119488. [2024-10-14 05:08:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119488 states, 119486 states have (on average 1.4411646552734212) internal successors, (172199), 119487 states have internal predecessors, (172199), 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-14 05:08:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119488 states to 119488 states and 172199 transitions. [2024-10-14 05:08:51,610 INFO L78 Accepts]: Start accepts. Automaton has 119488 states and 172199 transitions. Word has length 115 [2024-10-14 05:08:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:51,610 INFO L471 AbstractCegarLoop]: Abstraction has 119488 states and 172199 transitions. [2024-10-14 05:08:51,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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-14 05:08:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 119488 states and 172199 transitions. [2024-10-14 05:08:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:08:51,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:51,620 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 05:08:51,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:08:51,621 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1640902192, now seen corresponding path program 1 times [2024-10-14 05:08:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157813877] [2024-10-14 05:08:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 05:08:51,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:51,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157813877] [2024-10-14 05:08:51,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157813877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:51,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:51,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654090500] [2024-10-14 05:08:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:51,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:51,897 INFO L87 Difference]: Start difference. First operand 119488 states and 172199 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:59,598 INFO L93 Difference]: Finished difference Result 368722 states and 537008 transitions. [2024-10-14 05:08:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:08:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-14 05:08:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:00,255 INFO L225 Difference]: With dead ends: 368722 [2024-10-14 05:09:00,255 INFO L226 Difference]: Without dead ends: 336336 [2024-10-14 05:09:00,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:09:00,359 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 11923 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11923 SdHoareTripleChecker+Valid, 4797 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:00,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11923 Valid, 4797 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336336 states.