./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.7.ufo.UNBOUNDED.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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.7.ufo.UNBOUNDED.pals+Problem12_label03.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 2bcf8e94e45f6297ffcab2cc85820f358b499c9f0c3c1268c03065e80498ea32 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:36:37,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:36:37,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:36:37,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:36:37,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:36:37,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:36:37,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:36:37,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:36:37,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:36:37,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:36:37,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:36:37,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:36:37,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:36:37,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:36:37,436 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:36:37,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:36:37,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:36:37,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:36:37,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:36:37,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:36:37,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:36:37,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:36:37,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:36:37,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:36:37,443 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:36:37,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:36:37,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:36:37,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:36:37,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:36:37,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:36:37,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:36:37,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:36:37,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:36:37,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:36:37,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:36:37,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:36:37,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:36:37,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:36:37,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:36:37,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:36:37,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:36:37,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:36:37,462 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 -> 2bcf8e94e45f6297ffcab2cc85820f358b499c9f0c3c1268c03065e80498ea32 [2024-10-12 21:36:37,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:36:37,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:36:37,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:36:37,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:36:37,768 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:36:37,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-12 21:36:39,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:36:39,745 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:36:39,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-12 21:36:39,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06247538/b375c97272df484fb4e353baf01b0ae6/FLAG159c882a8 [2024-10-12 21:36:39,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06247538/b375c97272df484fb4e353baf01b0ae6 [2024-10-12 21:36:39,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:36:39,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:36:39,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:36:39,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:36:39,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:36:39,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:36:39" (1/1) ... [2024-10-12 21:36:39,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba3c7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:39, skipping insertion in model container [2024-10-12 21:36:39,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:36:39" (1/1) ... [2024-10-12 21:36:40,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:36:40,467 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.7.ufo.UNBOUNDED.pals+Problem12_label03.c[20454,20467] [2024-10-12 21:36:40,514 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.7.ufo.UNBOUNDED.pals+Problem12_label03.c[22791,22804] [2024-10-12 21:36:41,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:36:41,245 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:36:41,297 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.7.ufo.UNBOUNDED.pals+Problem12_label03.c[20454,20467] [2024-10-12 21:36:41,308 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.7.ufo.UNBOUNDED.pals+Problem12_label03.c[22791,22804] [2024-10-12 21:36:41,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:36:41,724 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:36:41,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41 WrapperNode [2024-10-12 21:36:41,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:36:41,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:36:41,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:36:41,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:36:41,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:41,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,142 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5219 [2024-10-12 21:36:42,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:36:42,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:36:42,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:36:42,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:36:42,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,488 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-12 21:36:42,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:36:42,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:36:42,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:36:42,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:36:42,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (1/1) ... [2024-10-12 21:36:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:36:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:36:42,859 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-12 21:36:42,860 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-12 21:36:42,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:36:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:36:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:36:42,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:36:43,003 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:36:43,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:36:47,409 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-12 21:36:47,409 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:36:47,477 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:36:47,477 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:36:47,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:36:47 BoogieIcfgContainer [2024-10-12 21:36:47,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:36:47,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:36:47,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:36:47,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:36:47,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:36:39" (1/3) ... [2024-10-12 21:36:47,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521acb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:36:47, skipping insertion in model container [2024-10-12 21:36:47,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:36:41" (2/3) ... [2024-10-12 21:36:47,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521acb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:36:47, skipping insertion in model container [2024-10-12 21:36:47,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:36:47" (3/3) ... [2024-10-12 21:36:47,487 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-12 21:36:47,502 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:36:47,503 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:36:47,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:36:47,620 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;@16a230c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:36:47,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:36:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 867 states, 864 states have (on average 1.9710648148148149) internal successors, (1703), 866 states have internal predecessors, (1703), 0 states have call successors, (0), 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-12 21:36:47,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:36:47,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:47,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:47,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:47,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1640482482, now seen corresponding path program 1 times [2024-10-12 21:36:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367803481] [2024-10-12 21:36:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:47,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:47,882 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-12 21:36:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367803481] [2024-10-12 21:36:47,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367803481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:36:47,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999890419] [2024-10-12 21:36:47,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:47,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:36:47,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:36:47,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:36:47,925 INFO L87 Difference]: Start difference. First operand has 867 states, 864 states have (on average 1.9710648148148149) internal successors, (1703), 866 states have internal predecessors, (1703), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-12 21:36:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:48,036 INFO L93 Difference]: Finished difference Result 1679 states and 3299 transitions. [2024-10-12 21:36:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:36:48,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 21:36:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:48,060 INFO L225 Difference]: With dead ends: 1679 [2024-10-12 21:36:48,061 INFO L226 Difference]: Without dead ends: 863 [2024-10-12 21:36:48,068 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-12 21:36:48,072 INFO L432 NwaCegarLoop]: 1631 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, 1631 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-12 21:36:48,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1631 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-12 21:36:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2024-10-12 21:36:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 861 states have (on average 1.8954703832752613) internal successors, (1632), 862 states have internal predecessors, (1632), 0 states have call successors, (0), 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-12 21:36:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1632 transitions. [2024-10-12 21:36:48,159 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1632 transitions. Word has length 19 [2024-10-12 21:36:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:48,160 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1632 transitions. [2024-10-12 21:36:48,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-12 21:36:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1632 transitions. [2024-10-12 21:36:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:36:48,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:48,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:36:48,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:36:48,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:48,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash 744272385, now seen corresponding path program 1 times [2024-10-12 21:36:48,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:48,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105023193] [2024-10-12 21:36:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:48,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:36:48,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105023193] [2024-10-12 21:36:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105023193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:48,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:36:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234443803] [2024-10-12 21:36:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:48,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:48,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:48,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:48,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:48,387 INFO L87 Difference]: Start difference. First operand 863 states and 1632 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-12 21:36:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:51,485 INFO L93 Difference]: Finished difference Result 2367 states and 4505 transitions. [2024-10-12 21:36:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:51,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 21:36:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:51,493 INFO L225 Difference]: With dead ends: 2367 [2024-10-12 21:36:51,493 INFO L226 Difference]: Without dead ends: 1614 [2024-10-12 21:36:51,495 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-12 21:36:51,496 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 992 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:51,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 618 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 21:36:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-12 21:36:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2024-10-12 21:36:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.6495037220843674) internal successors, (2659), 1613 states have internal predecessors, (2659), 0 states have call successors, (0), 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-12 21:36:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2659 transitions. [2024-10-12 21:36:51,581 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2659 transitions. Word has length 19 [2024-10-12 21:36:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:51,581 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2659 transitions. [2024-10-12 21:36:51,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-12 21:36:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2659 transitions. [2024-10-12 21:36:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 21:36:51,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:51,583 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] [2024-10-12 21:36:51,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:36:51,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:51,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1401330254, now seen corresponding path program 1 times [2024-10-12 21:36:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:51,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640177727] [2024-10-12 21:36:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:51,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:51,759 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-12 21:36:51,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:51,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640177727] [2024-10-12 21:36:51,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640177727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:51,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:36:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912604773] [2024-10-12 21:36:51,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:51,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:36:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:51,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:36:51,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:36:51,763 INFO L87 Difference]: Start difference. First operand 1614 states and 2659 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-12 21:36:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:51,878 INFO L93 Difference]: Finished difference Result 1672 states and 2751 transitions. [2024-10-12 21:36:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:36:51,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-12 21:36:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:51,886 INFO L225 Difference]: With dead ends: 1672 [2024-10-12 21:36:51,886 INFO L226 Difference]: Without dead ends: 1614 [2024-10-12 21:36:51,889 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-12 21:36:51,891 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 0 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4833 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:51,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4833 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:36:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-10-12 21:36:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2024-10-12 21:36:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.61848635235732) internal successors, (2609), 1613 states have internal predecessors, (2609), 0 states have call successors, (0), 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-12 21:36:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2609 transitions. [2024-10-12 21:36:51,934 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2609 transitions. Word has length 25 [2024-10-12 21:36:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:51,934 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2609 transitions. [2024-10-12 21:36:51,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-12 21:36:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2609 transitions. [2024-10-12 21:36:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 21:36:51,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:51,939 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] [2024-10-12 21:36:51,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:36:51,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:51,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1958225767, now seen corresponding path program 1 times [2024-10-12 21:36:51,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:51,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720368689] [2024-10-12 21:36:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:51,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:52,357 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-12 21:36:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720368689] [2024-10-12 21:36:52,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720368689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:52,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:52,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:36:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51928336] [2024-10-12 21:36:52,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:52,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:36:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:36:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:36:52,361 INFO L87 Difference]: Start difference. First operand 1614 states and 2609 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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-12 21:36:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:52,847 INFO L93 Difference]: Finished difference Result 2384 states and 3855 transitions. [2024-10-12 21:36:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:36:52,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-12 21:36:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:52,858 INFO L225 Difference]: With dead ends: 2384 [2024-10-12 21:36:52,859 INFO L226 Difference]: Without dead ends: 2329 [2024-10-12 21:36:52,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-12 21:36:52,864 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 11585 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11585 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:52,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11585 Valid, 4253 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:36:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2024-10-12 21:36:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1667. [2024-10-12 21:36:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.6186186186186187) internal successors, (2695), 1666 states have internal predecessors, (2695), 0 states have call successors, (0), 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-12 21:36:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2695 transitions. [2024-10-12 21:36:52,918 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2695 transitions. Word has length 74 [2024-10-12 21:36:52,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:52,918 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2695 transitions. [2024-10-12 21:36:52,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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-12 21:36:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2695 transitions. [2024-10-12 21:36:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 21:36:52,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:52,927 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] [2024-10-12 21:36:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:36:52,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -783811831, now seen corresponding path program 1 times [2024-10-12 21:36:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703070421] [2024-10-12 21:36:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:53,103 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-12 21:36:53,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:53,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703070421] [2024-10-12 21:36:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703070421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:53,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607744781] [2024-10-12 21:36:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:53,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:53,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:53,107 INFO L87 Difference]: Start difference. First operand 1667 states and 2695 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-12 21:36:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:53,162 INFO L93 Difference]: Finished difference Result 1872 states and 3026 transitions. [2024-10-12 21:36:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:53,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-12 21:36:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:53,170 INFO L225 Difference]: With dead ends: 1872 [2024-10-12 21:36:53,170 INFO L226 Difference]: Without dead ends: 1764 [2024-10-12 21:36:53,171 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-12 21:36:53,172 INFO L432 NwaCegarLoop]: 1575 mSDtfsCounter, 1498 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1656 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-12 21:36:53,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1656 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-10-12 21:36:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1760. [2024-10-12 21:36:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.617178612059158) internal successors, (2843), 1759 states have internal predecessors, (2843), 0 states have call successors, (0), 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-12 21:36:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2843 transitions. [2024-10-12 21:36:53,220 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2843 transitions. Word has length 76 [2024-10-12 21:36:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:53,220 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2843 transitions. [2024-10-12 21:36:53,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-12 21:36:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2843 transitions. [2024-10-12 21:36:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 21:36:53,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:53,223 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] [2024-10-12 21:36:53,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:36:53,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:53,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash -781666879, now seen corresponding path program 1 times [2024-10-12 21:36:53,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:53,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838959679] [2024-10-12 21:36:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:53,715 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-12 21:36:53,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838959679] [2024-10-12 21:36:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838959679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:53,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:53,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:36:53,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266167791] [2024-10-12 21:36:53,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:53,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:36:53,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:36:53,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:36:53,719 INFO L87 Difference]: Start difference. First operand 1760 states and 2843 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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-12 21:36:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:54,118 INFO L93 Difference]: Finished difference Result 1963 states and 3167 transitions. [2024-10-12 21:36:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:36:54,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-12 21:36:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:54,126 INFO L225 Difference]: With dead ends: 1963 [2024-10-12 21:36:54,126 INFO L226 Difference]: Without dead ends: 1762 [2024-10-12 21:36:54,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-12 21:36:54,128 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 10560 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10560 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:36:54,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10560 Valid, 2081 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:36:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2024-10-12 21:36:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2024-10-12 21:36:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.6160409556313993) internal successors, (2841), 1759 states have internal predecessors, (2841), 0 states have call successors, (0), 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-12 21:36:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2841 transitions. [2024-10-12 21:36:54,165 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2841 transitions. Word has length 76 [2024-10-12 21:36:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:54,166 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2841 transitions. [2024-10-12 21:36:54,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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-12 21:36:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2841 transitions. [2024-10-12 21:36:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 21:36:54,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:54,167 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] [2024-10-12 21:36:54,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:36:54,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:54,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1409718351, now seen corresponding path program 1 times [2024-10-12 21:36:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:54,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267534752] [2024-10-12 21:36:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:54,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:54,367 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-12 21:36:54,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:54,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267534752] [2024-10-12 21:36:54,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267534752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:54,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:54,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:36:54,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819468616] [2024-10-12 21:36:54,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:54,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:36:54,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:54,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:36:54,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:36:54,369 INFO L87 Difference]: Start difference. First operand 1760 states and 2841 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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-12 21:36:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:54,411 INFO L93 Difference]: Finished difference Result 1766 states and 2848 transitions. [2024-10-12 21:36:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:36:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-12 21:36:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:54,418 INFO L225 Difference]: With dead ends: 1766 [2024-10-12 21:36:54,419 INFO L226 Difference]: Without dead ends: 1764 [2024-10-12 21:36:54,419 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-12 21:36:54,422 INFO L432 NwaCegarLoop]: 1578 mSDtfsCounter, 0 mSDsluCounter, 3148 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4726 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-12 21:36:54,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4726 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-10-12 21:36:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2024-10-12 21:36:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1762 states have (on average 1.6140749148694664) internal successors, (2844), 1763 states have internal predecessors, (2844), 0 states have call successors, (0), 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-12 21:36:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2844 transitions. [2024-10-12 21:36:54,464 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2844 transitions. Word has length 77 [2024-10-12 21:36:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:54,464 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2844 transitions. [2024-10-12 21:36:54,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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-12 21:36:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2844 transitions. [2024-10-12 21:36:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:54,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:54,466 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] [2024-10-12 21:36:54,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:36:54,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:54,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash 89163937, now seen corresponding path program 1 times [2024-10-12 21:36:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:54,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784712444] [2024-10-12 21:36:54,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:54,540 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-12 21:36:54,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:54,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784712444] [2024-10-12 21:36:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784712444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:54,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:54,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:54,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856026844] [2024-10-12 21:36:54,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:54,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:54,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:54,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:54,542 INFO L87 Difference]: Start difference. First operand 1764 states and 2844 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:54,586 INFO L93 Difference]: Finished difference Result 2158 states and 3464 transitions. [2024-10-12 21:36:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:54,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-12 21:36:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:54,596 INFO L225 Difference]: With dead ends: 2158 [2024-10-12 21:36:54,596 INFO L226 Difference]: Without dead ends: 1953 [2024-10-12 21:36:54,598 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-12 21:36:54,599 INFO L432 NwaCegarLoop]: 1644 mSDtfsCounter, 1515 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1737 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-12 21:36:54,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1737 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2024-10-12 21:36:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1951. [2024-10-12 21:36:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1949 states have (on average 1.608517188301693) internal successors, (3135), 1950 states have internal predecessors, (3135), 0 states have call successors, (0), 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-12 21:36:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3135 transitions. [2024-10-12 21:36:54,642 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3135 transitions. Word has length 78 [2024-10-12 21:36:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:54,643 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3135 transitions. [2024-10-12 21:36:54,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3135 transitions. [2024-10-12 21:36:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:54,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:54,644 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] [2024-10-12 21:36:54,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:36:54,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:54,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash -321222751, now seen corresponding path program 1 times [2024-10-12 21:36:54,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:54,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579445618] [2024-10-12 21:36:54,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:54,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:54,705 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-12 21:36:54,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:54,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579445618] [2024-10-12 21:36:54,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579445618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:54,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:54,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:54,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796280107] [2024-10-12 21:36:54,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:54,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:54,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:54,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:54,707 INFO L87 Difference]: Start difference. First operand 1951 states and 3135 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:54,754 INFO L93 Difference]: Finished difference Result 2703 states and 4309 transitions. [2024-10-12 21:36:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-12 21:36:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:54,763 INFO L225 Difference]: With dead ends: 2703 [2024-10-12 21:36:54,763 INFO L226 Difference]: Without dead ends: 2311 [2024-10-12 21:36:54,764 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-12 21:36:54,765 INFO L432 NwaCegarLoop]: 1642 mSDtfsCounter, 1513 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1739 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-12 21:36:54,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1739 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2024-10-12 21:36:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2024-10-12 21:36:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2307 states have (on average 1.5973125270914608) internal successors, (3685), 2308 states have internal predecessors, (3685), 0 states have call successors, (0), 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-12 21:36:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3685 transitions. [2024-10-12 21:36:54,816 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3685 transitions. Word has length 78 [2024-10-12 21:36:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:54,816 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 3685 transitions. [2024-10-12 21:36:54,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3685 transitions. [2024-10-12 21:36:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:54,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:54,817 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] [2024-10-12 21:36:54,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:36:54,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:54,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -549861983, now seen corresponding path program 1 times [2024-10-12 21:36:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:54,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465180545] [2024-10-12 21:36:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:54,884 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-12 21:36:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465180545] [2024-10-12 21:36:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465180545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587530801] [2024-10-12 21:36:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:54,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:54,886 INFO L87 Difference]: Start difference. First operand 2309 states and 3685 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:54,937 INFO L93 Difference]: Finished difference Result 3745 states and 5903 transitions. [2024-10-12 21:36:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:54,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-12 21:36:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:54,951 INFO L225 Difference]: With dead ends: 3745 [2024-10-12 21:36:54,951 INFO L226 Difference]: Without dead ends: 2995 [2024-10-12 21:36:54,953 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-12 21:36:54,954 INFO L432 NwaCegarLoop]: 1630 mSDtfsCounter, 1509 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1735 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-12 21:36:54,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1735 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2024-10-12 21:36:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2993. [2024-10-12 21:36:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2991 states have (on average 1.5784018722835171) internal successors, (4721), 2992 states have internal predecessors, (4721), 0 states have call successors, (0), 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-12 21:36:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4721 transitions. [2024-10-12 21:36:55,021 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4721 transitions. Word has length 78 [2024-10-12 21:36:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:55,022 INFO L471 AbstractCegarLoop]: Abstraction has 2993 states and 4721 transitions. [2024-10-12 21:36:55,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4721 transitions. [2024-10-12 21:36:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:55,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:55,023 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] [2024-10-12 21:36:55,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:36:55,023 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:55,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:55,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1175518047, now seen corresponding path program 1 times [2024-10-12 21:36:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:55,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354283319] [2024-10-12 21:36:55,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:55,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:55,089 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-12 21:36:55,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354283319] [2024-10-12 21:36:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354283319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:55,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:55,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911252497] [2024-10-12 21:36:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:55,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:55,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:55,091 INFO L87 Difference]: Start difference. First operand 2993 states and 4721 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:55,174 INFO L93 Difference]: Finished difference Result 5733 states and 8899 transitions. [2024-10-12 21:36:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:55,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-12 21:36:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:55,189 INFO L225 Difference]: With dead ends: 5733 [2024-10-12 21:36:55,189 INFO L226 Difference]: Without dead ends: 4299 [2024-10-12 21:36:55,193 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-12 21:36:55,194 INFO L432 NwaCegarLoop]: 1628 mSDtfsCounter, 1507 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1737 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-12 21:36:55,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1737 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2024-10-12 21:36:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 4297. [2024-10-12 21:36:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 4295 states have (on average 1.5518044237485449) internal successors, (6665), 4296 states have internal predecessors, (6665), 0 states have call successors, (0), 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-12 21:36:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6665 transitions. [2024-10-12 21:36:55,312 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6665 transitions. Word has length 78 [2024-10-12 21:36:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:55,312 INFO L471 AbstractCegarLoop]: Abstraction has 4297 states and 6665 transitions. [2024-10-12 21:36:55,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6665 transitions. [2024-10-12 21:36:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:55,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:55,313 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] [2024-10-12 21:36:55,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:36:55,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:55,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash -286784607, now seen corresponding path program 1 times [2024-10-12 21:36:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496119280] [2024-10-12 21:36:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:55,384 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-12 21:36:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496119280] [2024-10-12 21:36:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496119280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:55,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:55,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750834487] [2024-10-12 21:36:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:55,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:55,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:55,386 INFO L87 Difference]: Start difference. First operand 4297 states and 6665 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:55,497 INFO L93 Difference]: Finished difference Result 9517 states and 14507 transitions. [2024-10-12 21:36:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:55,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-12 21:36:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:55,527 INFO L225 Difference]: With dead ends: 9517 [2024-10-12 21:36:55,528 INFO L226 Difference]: Without dead ends: 6779 [2024-10-12 21:36:55,534 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-12 21:36:55,534 INFO L432 NwaCegarLoop]: 1626 mSDtfsCounter, 1505 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1739 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-12 21:36:55,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1739 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6779 states. [2024-10-12 21:36:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6779 to 6777. [2024-10-12 21:36:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6777 states, 6775 states have (on average 1.5198523985239853) internal successors, (10297), 6776 states have internal predecessors, (10297), 0 states have call successors, (0), 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-12 21:36:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6777 states to 6777 states and 10297 transitions. [2024-10-12 21:36:55,785 INFO L78 Accepts]: Start accepts. Automaton has 6777 states and 10297 transitions. Word has length 78 [2024-10-12 21:36:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:55,786 INFO L471 AbstractCegarLoop]: Abstraction has 6777 states and 10297 transitions. [2024-10-12 21:36:55,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6777 states and 10297 transitions. [2024-10-12 21:36:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:36:55,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:55,787 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] [2024-10-12 21:36:55,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:36:55,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:55,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash -589805919, now seen corresponding path program 1 times [2024-10-12 21:36:55,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:55,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64639655] [2024-10-12 21:36:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:55,846 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-12 21:36:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:55,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64639655] [2024-10-12 21:36:55,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64639655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:55,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:55,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110613767] [2024-10-12 21:36:55,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:55,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:55,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:55,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:55,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:55,850 INFO L87 Difference]: Start difference. First operand 6777 states and 10297 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:56,033 INFO L93 Difference]: Finished difference Result 16701 states and 24955 transitions. [2024-10-12 21:36:56,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:56,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-12 21:36:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:56,059 INFO L225 Difference]: With dead ends: 16701 [2024-10-12 21:36:56,059 INFO L226 Difference]: Without dead ends: 11483 [2024-10-12 21:36:56,069 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-12 21:36:56,070 INFO L432 NwaCegarLoop]: 1640 mSDtfsCounter, 1511 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1741 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-12 21:36:56,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1741 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11483 states. [2024-10-12 21:36:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11483 to 11481. [2024-10-12 21:36:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11481 states, 11479 states have (on average 1.4852339053924557) internal successors, (17049), 11480 states have internal predecessors, (17049), 0 states have call successors, (0), 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-12 21:36:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11481 states to 11481 states and 17049 transitions. [2024-10-12 21:36:56,394 INFO L78 Accepts]: Start accepts. Automaton has 11481 states and 17049 transitions. Word has length 78 [2024-10-12 21:36:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:56,394 INFO L471 AbstractCegarLoop]: Abstraction has 11481 states and 17049 transitions. [2024-10-12 21:36:56,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:36:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 11481 states and 17049 transitions. [2024-10-12 21:36:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:36:56,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:56,396 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] [2024-10-12 21:36:56,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:36:56,396 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:56,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1500697018, now seen corresponding path program 1 times [2024-10-12 21:36:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279663898] [2024-10-12 21:36:56,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:56,458 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-12 21:36:56,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279663898] [2024-10-12 21:36:56,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279663898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:56,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:36:56,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:36:56,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087368622] [2024-10-12 21:36:56,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:56,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:56,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:56,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:56,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:36:56,461 INFO L87 Difference]: Start difference. First operand 11481 states and 17049 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-12 21:36:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:36:56,709 INFO L93 Difference]: Finished difference Result 21728 states and 32287 transitions. [2024-10-12 21:36:56,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:36:56,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-12 21:36:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:36:56,743 INFO L225 Difference]: With dead ends: 21728 [2024-10-12 21:36:56,743 INFO L226 Difference]: Without dead ends: 16221 [2024-10-12 21:36:56,755 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-12 21:36:56,756 INFO L432 NwaCegarLoop]: 1649 mSDtfsCounter, 1514 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1738 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-12 21:36:56,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1738 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:36:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16221 states. [2024-10-12 21:36:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16221 to 16219. [2024-10-12 21:36:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16219 states, 16217 states have (on average 1.4737004378121723) internal successors, (23899), 16218 states have internal predecessors, (23899), 0 states have call successors, (0), 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-12 21:36:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16219 states to 16219 states and 23899 transitions. [2024-10-12 21:36:57,305 INFO L78 Accepts]: Start accepts. Automaton has 16219 states and 23899 transitions. Word has length 80 [2024-10-12 21:36:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:36:57,306 INFO L471 AbstractCegarLoop]: Abstraction has 16219 states and 23899 transitions. [2024-10-12 21:36:57,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-12 21:36:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 16219 states and 23899 transitions. [2024-10-12 21:36:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 21:36:57,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:36:57,308 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:36:57,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:36:57,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:36:57,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:36:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash -382667676, now seen corresponding path program 1 times [2024-10-12 21:36:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:36:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806462660] [2024-10-12 21:36:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:36:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:36:57,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:36:57,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806462660] [2024-10-12 21:36:57,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806462660] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:36:57,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41022793] [2024-10-12 21:36:57,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:36:57,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:36:57,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:36:57,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:36:57,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:36:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:36:57,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:36:57,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:36:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:36:57,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:36:57,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41022793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:36:57,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:36:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 21:36:57,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034513964] [2024-10-12 21:36:57,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:36:57,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:36:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:36:57,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:36:57,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:36:57,663 INFO L87 Difference]: Start difference. First operand 16219 states and 23899 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-12 21:37:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:01,430 INFO L93 Difference]: Finished difference Result 19225 states and 28826 transitions. [2024-10-12 21:37:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:37:01,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-12 21:37:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:01,467 INFO L225 Difference]: With dead ends: 19225 [2024-10-12 21:37:01,468 INFO L226 Difference]: Without dead ends: 17721 [2024-10-12 21:37:01,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:37:01,476 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 924 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:01,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 615 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-12 21:37:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17721 states. [2024-10-12 21:37:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17721 to 17721. [2024-10-12 21:37:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17721 states, 17719 states have (on average 1.4514927478977369) internal successors, (25719), 17720 states have internal predecessors, (25719), 0 states have call successors, (0), 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-12 21:37:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17721 states to 17721 states and 25719 transitions. [2024-10-12 21:37:02,035 INFO L78 Accepts]: Start accepts. Automaton has 17721 states and 25719 transitions. Word has length 90 [2024-10-12 21:37:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:02,035 INFO L471 AbstractCegarLoop]: Abstraction has 17721 states and 25719 transitions. [2024-10-12 21:37:02,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-12 21:37:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 17721 states and 25719 transitions. [2024-10-12 21:37:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 21:37:02,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:02,038 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:37:02,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:37:02,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-12 21:37:02,239 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:02,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash -568314130, now seen corresponding path program 1 times [2024-10-12 21:37:02,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:02,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749621629] [2024-10-12 21:37:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:02,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:37:02,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:02,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749621629] [2024-10-12 21:37:02,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749621629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:02,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:02,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:37:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449998779] [2024-10-12 21:37:02,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:02,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:37:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:02,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:37:02,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:37:02,349 INFO L87 Difference]: Start difference. First operand 17721 states and 25719 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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-12 21:37:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:05,678 INFO L93 Difference]: Finished difference Result 23733 states and 34287 transitions. [2024-10-12 21:37:05,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:37:05,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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-12 21:37:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:05,720 INFO L225 Difference]: With dead ends: 23733 [2024-10-12 21:37:05,720 INFO L226 Difference]: Without dead ends: 20727 [2024-10-12 21:37:05,733 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-12 21:37:05,734 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 1059 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:05,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 723 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 21:37:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20727 states. [2024-10-12 21:37:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20727 to 20725. [2024-10-12 21:37:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20725 states, 20723 states have (on average 1.41967861796072) internal successors, (29420), 20724 states have internal predecessors, (29420), 0 states have call successors, (0), 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-12 21:37:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20725 states to 20725 states and 29420 transitions. [2024-10-12 21:37:06,157 INFO L78 Accepts]: Start accepts. Automaton has 20725 states and 29420 transitions. Word has length 94 [2024-10-12 21:37:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:06,158 INFO L471 AbstractCegarLoop]: Abstraction has 20725 states and 29420 transitions. [2024-10-12 21:37:06,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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-12 21:37:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 20725 states and 29420 transitions. [2024-10-12 21:37:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:06,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:06,162 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:37:06,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:37:06,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1623175948, now seen corresponding path program 1 times [2024-10-12 21:37:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740979611] [2024-10-12 21:37:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:37:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740979611] [2024-10-12 21:37:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740979611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:06,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699741654] [2024-10-12 21:37:06,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:06,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:06,405 INFO L87 Difference]: Start difference. First operand 20725 states and 29420 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-12 21:37:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:08,008 INFO L93 Difference]: Finished difference Result 126277 states and 183220 transitions. [2024-10-12 21:37:08,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:08,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-12 21:37:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:08,283 INFO L225 Difference]: With dead ends: 126277 [2024-10-12 21:37:08,283 INFO L226 Difference]: Without dead ends: 111619 [2024-10-12 21:37:08,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:08,336 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 9880 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9880 SdHoareTripleChecker+Valid, 4406 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:08,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9880 Valid, 4406 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:37:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111619 states. [2024-10-12 21:37:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111619 to 35381. [2024-10-12 21:37:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35381 states, 35379 states have (on average 1.4303400322225048) internal successors, (50604), 35380 states have internal predecessors, (50604), 0 states have call successors, (0), 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-12 21:37:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35381 states to 35381 states and 50604 transitions. [2024-10-12 21:37:10,215 INFO L78 Accepts]: Start accepts. Automaton has 35381 states and 50604 transitions. Word has length 100 [2024-10-12 21:37:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:10,216 INFO L471 AbstractCegarLoop]: Abstraction has 35381 states and 50604 transitions. [2024-10-12 21:37:10,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-12 21:37:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35381 states and 50604 transitions. [2024-10-12 21:37:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:10,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:10,221 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:37:10,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:37:10,221 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:10,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:10,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1212789260, now seen corresponding path program 1 times [2024-10-12 21:37:10,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:10,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90285515] [2024-10-12 21:37:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 21:37:10,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:10,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90285515] [2024-10-12 21:37:10,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90285515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:10,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:10,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:10,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207194011] [2024-10-12 21:37:10,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:10,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:10,452 INFO L87 Difference]: Start difference. First operand 35381 states and 50604 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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-12 21:37:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:12,506 INFO L93 Difference]: Finished difference Result 140933 states and 204404 transitions. [2024-10-12 21:37:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:12,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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-12 21:37:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:12,740 INFO L225 Difference]: With dead ends: 140933 [2024-10-12 21:37:12,740 INFO L226 Difference]: Without dead ends: 126275 [2024-10-12 21:37:12,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:12,788 INFO L432 NwaCegarLoop]: 1664 mSDtfsCounter, 9928 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9928 SdHoareTripleChecker+Valid, 4244 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:12,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9928 Valid, 4244 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:37:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126275 states. [2024-10-12 21:37:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126275 to 57397. [2024-10-12 21:37:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57397 states, 57395 states have (on average 1.4325289659377995) internal successors, (82220), 57396 states have internal predecessors, (82220), 0 states have call successors, (0), 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-12 21:37:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57397 states to 57397 states and 82220 transitions. [2024-10-12 21:37:15,039 INFO L78 Accepts]: Start accepts. Automaton has 57397 states and 82220 transitions. Word has length 100 [2024-10-12 21:37:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:15,040 INFO L471 AbstractCegarLoop]: Abstraction has 57397 states and 82220 transitions. [2024-10-12 21:37:15,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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-12 21:37:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 57397 states and 82220 transitions. [2024-10-12 21:37:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:15,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:15,047 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:37:15,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:37:15,047 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:15,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:15,048 INFO L85 PathProgramCache]: Analyzing trace with hash 984150028, now seen corresponding path program 1 times [2024-10-12 21:37:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071156334] [2024-10-12 21:37:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 21:37:15,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071156334] [2024-10-12 21:37:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071156334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733570683] [2024-10-12 21:37:15,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:15,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:15,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:15,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:15,315 INFO L87 Difference]: Start difference. First operand 57397 states and 82220 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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-12 21:37:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:18,641 INFO L93 Difference]: Finished difference Result 155589 states and 225588 transitions. [2024-10-12 21:37:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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 100 [2024-10-12 21:37:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:18,882 INFO L225 Difference]: With dead ends: 155589 [2024-10-12 21:37:18,882 INFO L226 Difference]: Without dead ends: 140931 [2024-10-12 21:37:18,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:18,927 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 9995 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9995 SdHoareTripleChecker+Valid, 4277 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:18,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9995 Valid, 4277 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:37:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140931 states. [2024-10-12 21:37:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140931 to 72053. [2024-10-12 21:37:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72053 states, 72051 states have (on average 1.4351501020110755) internal successors, (103404), 72052 states have internal predecessors, (103404), 0 states have call successors, (0), 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-12 21:37:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72053 states to 72053 states and 103404 transitions. [2024-10-12 21:37:21,488 INFO L78 Accepts]: Start accepts. Automaton has 72053 states and 103404 transitions. Word has length 100 [2024-10-12 21:37:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:21,488 INFO L471 AbstractCegarLoop]: Abstraction has 72053 states and 103404 transitions. [2024-10-12 21:37:21,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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-12 21:37:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 72053 states and 103404 transitions. [2024-10-12 21:37:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:21,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:21,495 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:37:21,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:37:21,496 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:21,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash 358493964, now seen corresponding path program 1 times [2024-10-12 21:37:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:21,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644477604] [2024-10-12 21:37:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:21,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:37:21,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:21,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644477604] [2024-10-12 21:37:21,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644477604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:21,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:21,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:21,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280354962] [2024-10-12 21:37:21,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:21,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:21,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:21,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:21,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:21,930 INFO L87 Difference]: Start difference. First operand 72053 states and 103404 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 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-12 21:37:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:25,115 INFO L93 Difference]: Finished difference Result 170245 states and 246772 transitions. [2024-10-12 21:37:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:25,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 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 100 [2024-10-12 21:37:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:25,374 INFO L225 Difference]: With dead ends: 170245 [2024-10-12 21:37:25,374 INFO L226 Difference]: Without dead ends: 155587 [2024-10-12 21:37:25,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:25,418 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 10061 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10061 SdHoareTripleChecker+Valid, 4238 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:25,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10061 Valid, 4238 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:37:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155587 states. [2024-10-12 21:37:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155587 to 86709. [2024-10-12 21:37:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86709 states, 86707 states have (on average 1.4368851419147244) internal successors, (124588), 86708 states have internal predecessors, (124588), 0 states have call successors, (0), 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-12 21:37:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86709 states to 86709 states and 124588 transitions. [2024-10-12 21:37:28,525 INFO L78 Accepts]: Start accepts. Automaton has 86709 states and 124588 transitions. Word has length 100 [2024-10-12 21:37:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:28,526 INFO L471 AbstractCegarLoop]: Abstraction has 86709 states and 124588 transitions. [2024-10-12 21:37:28,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 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-12 21:37:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 86709 states and 124588 transitions. [2024-10-12 21:37:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:28,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:28,533 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:37:28,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:37:28,533 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:28,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:28,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1247227404, now seen corresponding path program 1 times [2024-10-12 21:37:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:28,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55413842] [2024-10-12 21:37:28,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:28,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:37:29,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:29,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55413842] [2024-10-12 21:37:29,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55413842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:29,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:29,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:29,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694221671] [2024-10-12 21:37:29,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:29,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:29,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:29,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:29,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:29,034 INFO L87 Difference]: Start difference. First operand 86709 states and 124588 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-12 21:37:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:32,990 INFO L93 Difference]: Finished difference Result 184901 states and 267956 transitions. [2024-10-12 21:37:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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 100 [2024-10-12 21:37:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:33,406 INFO L225 Difference]: With dead ends: 184901 [2024-10-12 21:37:33,406 INFO L226 Difference]: Without dead ends: 170243 [2024-10-12 21:37:33,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:33,441 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 9915 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9915 SdHoareTripleChecker+Valid, 4321 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:33,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9915 Valid, 4321 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:37:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170243 states. [2024-10-12 21:37:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170243 to 101365. [2024-10-12 21:37:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101365 states, 101363 states have (on average 1.4381184455866538) internal successors, (145772), 101364 states have internal predecessors, (145772), 0 states have call successors, (0), 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-12 21:37:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101365 states to 101365 states and 145772 transitions. [2024-10-12 21:37:37,157 INFO L78 Accepts]: Start accepts. Automaton has 101365 states and 145772 transitions. Word has length 100 [2024-10-12 21:37:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:37:37,158 INFO L471 AbstractCegarLoop]: Abstraction has 101365 states and 145772 transitions. [2024-10-12 21:37:37,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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-12 21:37:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 101365 states and 145772 transitions. [2024-10-12 21:37:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:37:37,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:37:37,163 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:37:37,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:37:37,164 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:37:37,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:37:37,164 INFO L85 PathProgramCache]: Analyzing trace with hash 944206092, now seen corresponding path program 1 times [2024-10-12 21:37:37,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:37:37,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816957218] [2024-10-12 21:37:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:37:37,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:37:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:37:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 21:37:37,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:37:37,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816957218] [2024-10-12 21:37:37,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816957218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:37:37,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:37:37,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:37:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731598793] [2024-10-12 21:37:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:37:37,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:37:37,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:37:37,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:37:37,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:37:37,366 INFO L87 Difference]: Start difference. First operand 101365 states and 145772 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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-12 21:37:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:37:41,658 INFO L93 Difference]: Finished difference Result 199557 states and 289140 transitions. [2024-10-12 21:37:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:37:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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 100 [2024-10-12 21:37:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:37:41,946 INFO L225 Difference]: With dead ends: 199557 [2024-10-12 21:37:41,946 INFO L226 Difference]: Without dead ends: 184899 [2024-10-12 21:37:41,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:37:41,998 INFO L432 NwaCegarLoop]: 1666 mSDtfsCounter, 9815 mSDsluCounter, 2828 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9815 SdHoareTripleChecker+Valid, 4494 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:37:41,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9815 Valid, 4494 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:37:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184899 states.