./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.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.graphml --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 5054b3667a60af3f61474096f335d8baa07a6095dce3dfeeb01aec4cc568aead --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:32:04,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:32:04,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:32:04,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:32:04,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:32:04,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:32:04,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:32:04,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:32:04,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:32:04,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:32:04,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:32:04,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:32:04,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:32:04,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:32:04,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:32:04,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:32:04,762 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:32:04,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:32:04,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:32:04,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:32:04,770 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:32:04,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:32:04,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:32:04,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:32:04,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:32:04,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:32:04,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:32:04,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:32:04,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:32:04,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:32:04,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:32:04,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:32:04,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:32:04,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:32:04,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:32:04,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:32:04,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:32:04,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:32:04,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:32:04,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:32:04,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:32:04,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:32:04,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:32:04,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:32:04,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:32:04,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:32:04,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:32:04,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:32:04,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:32:04,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:32:04,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:32:04,810 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:32:04,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:32:04,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:32:04,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:32:04,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:32:04,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:32:04,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:32:04,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:32:04,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:32:04,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:32:04,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:32:04,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:32:04,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:32:04,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:32:04,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:32:04,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:32:04,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:32:04,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:32:04,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:32:04,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:32:04,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:32:04,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:32:04,813 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:32:04,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:32:04,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:32:04,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 5054b3667a60af3f61474096f335d8baa07a6095dce3dfeeb01aec4cc568aead [2022-07-13 11:32:05,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:32:05,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:32:05,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:32:05,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:32:05,036 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:32:05,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c [2022-07-13 11:32:05,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3cbce9f/9733707e0fd343d4b68e01aff5002cc9/FLAGbc28db21a [2022-07-13 11:32:05,492 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:32:05,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c [2022-07-13 11:32:05,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3cbce9f/9733707e0fd343d4b68e01aff5002cc9/FLAGbc28db21a [2022-07-13 11:32:05,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b3cbce9f/9733707e0fd343d4b68e01aff5002cc9 [2022-07-13 11:32:05,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:32:05,520 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:32:05,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:32:05,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:32:05,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:32:05,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685eca88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05, skipping insertion in model container [2022-07-13 11:32:05,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:32:05,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:32:05,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c[44970,44983] [2022-07-13 11:32:05,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:32:05,725 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:32:05,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_8.cil.c[44970,44983] [2022-07-13 11:32:05,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:32:05,785 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:32:05,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05 WrapperNode [2022-07-13 11:32:05,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:32:05,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:32:05,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:32:05,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:32:05,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,846 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 558 [2022-07-13 11:32:05,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:32:05,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:32:05,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:32:05,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:32:05,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:32:05,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:32:05,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:32:05,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:32:05,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (1/1) ... [2022-07-13 11:32:05,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:32:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:32:05,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:32:05,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:32:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:32:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:32:05,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:32:05,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:32:06,011 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:32:06,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:32:06,037 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:06,421 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:32:06,421 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:32:06,421 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:32:06,426 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:32:06,426 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:32:06,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:32:06 BoogieIcfgContainer [2022-07-13 11:32:06,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:32:06,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:32:06,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:32:06,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:32:06,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:32:05" (1/3) ... [2022-07-13 11:32:06,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bc4cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:32:06, skipping insertion in model container [2022-07-13 11:32:06,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:05" (2/3) ... [2022-07-13 11:32:06,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bc4cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:32:06, skipping insertion in model container [2022-07-13 11:32:06,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:32:06" (3/3) ... [2022-07-13 11:32:06,439 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2022-07-13 11:32:06,448 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:32:06,449 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:32:06,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:32:06,508 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1fcc4f8e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@80ee997 [2022-07-13 11:32:06,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:32:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.7379310344827585) internal successors, (252), 146 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 11:32:06,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:06,537 INFO L195 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] [2022-07-13 11:32:06,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash -737748433, now seen corresponding path program 1 times [2022-07-13 11:32:06,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:06,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969024297] [2022-07-13 11:32:06,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:06,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:06,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:06,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969024297] [2022-07-13 11:32:06,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969024297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:06,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:06,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800103531] [2022-07-13 11:32:06,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:06,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:06,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:06,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:06,779 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.7379310344827585) internal successors, (252), 146 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:06,950 INFO L93 Difference]: Finished difference Result 339 states and 586 transitions. [2022-07-13 11:32:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-07-13 11:32:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:06,959 INFO L225 Difference]: With dead ends: 339 [2022-07-13 11:32:06,960 INFO L226 Difference]: Without dead ends: 180 [2022-07-13 11:32:06,962 INFO L412 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 [2022-07-13 11:32:06,964 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 188 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:06,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 205 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-13 11:32:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2022-07-13 11:32:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.631578947368421) internal successors, (279), 171 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 279 transitions. [2022-07-13 11:32:06,995 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 279 transitions. Word has length 42 [2022-07-13 11:32:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:06,996 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 279 transitions. [2022-07-13 11:32:06,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 279 transitions. [2022-07-13 11:32:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:32:06,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:06,997 INFO L195 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] [2022-07-13 11:32:06,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:32:06,998 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 948641361, now seen corresponding path program 1 times [2022-07-13 11:32:06,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:06,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959461982] [2022-07-13 11:32:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:07,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959461982] [2022-07-13 11:32:07,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959461982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:07,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:07,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063202993] [2022-07-13 11:32:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:07,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:07,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:07,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:07,040 INFO L87 Difference]: Start difference. First operand 172 states and 279 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:07,187 INFO L93 Difference]: Finished difference Result 383 states and 631 transitions. [2022-07-13 11:32:07,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:07,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-07-13 11:32:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:07,192 INFO L225 Difference]: With dead ends: 383 [2022-07-13 11:32:07,192 INFO L226 Difference]: Without dead ends: 219 [2022-07-13 11:32:07,197 INFO L412 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 [2022-07-13 11:32:07,198 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 145 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:07,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 159 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-13 11:32:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 211. [2022-07-13 11:32:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2022-07-13 11:32:07,216 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 43 [2022-07-13 11:32:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:07,217 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2022-07-13 11:32:07,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2022-07-13 11:32:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 11:32:07,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:07,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:07,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:32:07,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:07,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:07,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1292311850, now seen corresponding path program 1 times [2022-07-13 11:32:07,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:07,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824173993] [2022-07-13 11:32:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:07,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:07,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:07,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824173993] [2022-07-13 11:32:07,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824173993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:07,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:07,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:07,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466141779] [2022-07-13 11:32:07,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:07,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:07,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:07,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:07,265 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:07,356 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2022-07-13 11:32:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:07,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-07-13 11:32:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:07,358 INFO L225 Difference]: With dead ends: 445 [2022-07-13 11:32:07,358 INFO L226 Difference]: Without dead ends: 242 [2022-07-13 11:32:07,358 INFO L412 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 [2022-07-13 11:32:07,359 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 148 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:07,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 167 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-13 11:32:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-13 11:32:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2022-07-13 11:32:07,367 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 70 [2022-07-13 11:32:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:07,367 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2022-07-13 11:32:07,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2022-07-13 11:32:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 11:32:07,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:07,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:07,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:32:07,370 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:07,371 INFO L85 PathProgramCache]: Analyzing trace with hash 536323774, now seen corresponding path program 1 times [2022-07-13 11:32:07,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:07,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487166595] [2022-07-13 11:32:07,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:07,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:07,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487166595] [2022-07-13 11:32:07,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487166595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:07,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:07,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847220942] [2022-07-13 11:32:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:07,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:07,422 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:07,513 INFO L93 Difference]: Finished difference Result 514 states and 873 transitions. [2022-07-13 11:32:07,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:07,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-07-13 11:32:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:07,515 INFO L225 Difference]: With dead ends: 514 [2022-07-13 11:32:07,515 INFO L226 Difference]: Without dead ends: 280 [2022-07-13 11:32:07,516 INFO L412 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 [2022-07-13 11:32:07,516 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 149 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:07,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 150 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-13 11:32:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2022-07-13 11:32:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7075812274368232) internal successors, (473), 277 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 473 transitions. [2022-07-13 11:32:07,523 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 473 transitions. Word has length 75 [2022-07-13 11:32:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:07,524 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 473 transitions. [2022-07-13 11:32:07,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 473 transitions. [2022-07-13 11:32:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 11:32:07,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:07,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:07,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:32:07,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1235838524, now seen corresponding path program 1 times [2022-07-13 11:32:07,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:07,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693573376] [2022-07-13 11:32:07,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:07,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:07,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693573376] [2022-07-13 11:32:07,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693573376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:07,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:07,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729598476] [2022-07-13 11:32:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:07,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:07,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:07,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:07,560 INFO L87 Difference]: Start difference. First operand 278 states and 473 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) [2022-07-13 11:32:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:07,678 INFO L93 Difference]: Finished difference Result 550 states and 936 transitions. [2022-07-13 11:32:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:07,678 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 [2022-07-13 11:32:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:07,680 INFO L225 Difference]: With dead ends: 550 [2022-07-13 11:32:07,680 INFO L226 Difference]: Without dead ends: 280 [2022-07-13 11:32:07,680 INFO L412 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 [2022-07-13 11:32:07,681 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 148 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:07,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 150 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-13 11:32:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2022-07-13 11:32:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7003610108303249) internal successors, (471), 277 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 471 transitions. [2022-07-13 11:32:07,687 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 471 transitions. Word has length 76 [2022-07-13 11:32:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:07,688 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 471 transitions. [2022-07-13 11:32:07,688 INFO L496 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) [2022-07-13 11:32:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 471 transitions. [2022-07-13 11:32:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 11:32:07,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:07,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:07,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:32:07,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:07,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash -319662848, now seen corresponding path program 1 times [2022-07-13 11:32:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:07,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093750776] [2022-07-13 11:32:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:32:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:07,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093750776] [2022-07-13 11:32:07,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093750776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:07,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:07,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616899954] [2022-07-13 11:32:07,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:07,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:07,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:07,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:07,742 INFO L87 Difference]: Start difference. First operand 278 states and 471 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:07,813 INFO L93 Difference]: Finished difference Result 565 states and 958 transitions. [2022-07-13 11:32:07,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:07,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 82 [2022-07-13 11:32:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:07,815 INFO L225 Difference]: With dead ends: 565 [2022-07-13 11:32:07,815 INFO L226 Difference]: Without dead ends: 295 [2022-07-13 11:32:07,816 INFO L412 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 [2022-07-13 11:32:07,816 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 170 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:07,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 162 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-13 11:32:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-07-13 11:32:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.6883561643835616) internal successors, (493), 292 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 493 transitions. [2022-07-13 11:32:07,822 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 493 transitions. Word has length 82 [2022-07-13 11:32:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:07,823 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 493 transitions. [2022-07-13 11:32:07,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 493 transitions. [2022-07-13 11:32:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-13 11:32:07,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:07,824 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:07,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:32:07,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 36611111, now seen corresponding path program 1 times [2022-07-13 11:32:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:07,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427443826] [2022-07-13 11:32:07,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:32:07,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:07,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427443826] [2022-07-13 11:32:07,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427443826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:07,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:07,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604950696] [2022-07-13 11:32:07,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:07,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:07,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:07,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:07,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:07,858 INFO L87 Difference]: Start difference. First operand 293 states and 493 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:07,921 INFO L93 Difference]: Finished difference Result 580 states and 976 transitions. [2022-07-13 11:32:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-07-13 11:32:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:07,923 INFO L225 Difference]: With dead ends: 580 [2022-07-13 11:32:07,923 INFO L226 Difference]: Without dead ends: 295 [2022-07-13 11:32:07,923 INFO L412 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 [2022-07-13 11:32:07,924 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 169 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:07,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 150 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-13 11:32:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-07-13 11:32:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.6746575342465753) internal successors, (489), 292 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 489 transitions. [2022-07-13 11:32:07,933 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 489 transitions. Word has length 83 [2022-07-13 11:32:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:07,933 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 489 transitions. [2022-07-13 11:32:07,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 489 transitions. [2022-07-13 11:32:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 11:32:07,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:07,937 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:07,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:32:07,938 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:07,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1085911816, now seen corresponding path program 1 times [2022-07-13 11:32:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:07,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775623631] [2022-07-13 11:32:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-13 11:32:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:07,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775623631] [2022-07-13 11:32:07,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775623631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:07,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:07,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057288988] [2022-07-13 11:32:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:07,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:07,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:07,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:07,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:07,985 INFO L87 Difference]: Start difference. First operand 293 states and 489 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:08,040 INFO L93 Difference]: Finished difference Result 587 states and 978 transitions. [2022-07-13 11:32:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:08,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 95 [2022-07-13 11:32:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:08,041 INFO L225 Difference]: With dead ends: 587 [2022-07-13 11:32:08,041 INFO L226 Difference]: Without dead ends: 302 [2022-07-13 11:32:08,042 INFO L412 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 [2022-07-13 11:32:08,044 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 174 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:08,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 161 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-13 11:32:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-07-13 11:32:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.6445182724252492) internal successors, (495), 301 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 495 transitions. [2022-07-13 11:32:08,053 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 495 transitions. Word has length 95 [2022-07-13 11:32:08,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:08,054 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 495 transitions. [2022-07-13 11:32:08,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 495 transitions. [2022-07-13 11:32:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 11:32:08,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:08,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:08,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:32:08,057 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1253123203, now seen corresponding path program 1 times [2022-07-13 11:32:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:08,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342180332] [2022-07-13 11:32:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:32:08,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:08,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342180332] [2022-07-13 11:32:08,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342180332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:08,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:08,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:08,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029878726] [2022-07-13 11:32:08,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:08,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:08,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:08,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:08,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:08,100 INFO L87 Difference]: Start difference. First operand 302 states and 495 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:08,180 INFO L93 Difference]: Finished difference Result 627 states and 1031 transitions. [2022-07-13 11:32:08,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:08,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 96 [2022-07-13 11:32:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:08,182 INFO L225 Difference]: With dead ends: 627 [2022-07-13 11:32:08,182 INFO L226 Difference]: Without dead ends: 333 [2022-07-13 11:32:08,182 INFO L412 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 [2022-07-13 11:32:08,183 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 153 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:08,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 153 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-13 11:32:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2022-07-13 11:32:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.6424242424242423) internal successors, (542), 330 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 542 transitions. [2022-07-13 11:32:08,189 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 542 transitions. Word has length 96 [2022-07-13 11:32:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:08,190 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 542 transitions. [2022-07-13 11:32:08,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 542 transitions. [2022-07-13 11:32:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 11:32:08,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:08,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:08,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:32:08,191 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667318, now seen corresponding path program 1 times [2022-07-13 11:32:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:08,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432425960] [2022-07-13 11:32:08,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:08,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:32:08,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:08,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432425960] [2022-07-13 11:32:08,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432425960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:08,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:08,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:08,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097487032] [2022-07-13 11:32:08,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:08,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:08,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:08,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:08,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:08,216 INFO L87 Difference]: Start difference. First operand 331 states and 542 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:08,297 INFO L93 Difference]: Finished difference Result 656 states and 1074 transitions. [2022-07-13 11:32:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:08,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 97 [2022-07-13 11:32:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:08,299 INFO L225 Difference]: With dead ends: 656 [2022-07-13 11:32:08,299 INFO L226 Difference]: Without dead ends: 333 [2022-07-13 11:32:08,300 INFO L412 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 [2022-07-13 11:32:08,300 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 152 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:08,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 153 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-13 11:32:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2022-07-13 11:32:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.6303030303030304) internal successors, (538), 330 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 538 transitions. [2022-07-13 11:32:08,308 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 538 transitions. Word has length 97 [2022-07-13 11:32:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:08,309 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 538 transitions. [2022-07-13 11:32:08,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 538 transitions. [2022-07-13 11:32:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 11:32:08,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:08,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:08,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:32:08,310 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:08,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1620850381, now seen corresponding path program 1 times [2022-07-13 11:32:08,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:08,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936742496] [2022-07-13 11:32:08,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:08,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:32:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:08,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936742496] [2022-07-13 11:32:08,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936742496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:08,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:08,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328476171] [2022-07-13 11:32:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:08,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:08,340 INFO L87 Difference]: Start difference. First operand 331 states and 538 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:08,418 INFO L93 Difference]: Finished difference Result 689 states and 1124 transitions. [2022-07-13 11:32:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:08,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 98 [2022-07-13 11:32:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:08,420 INFO L225 Difference]: With dead ends: 689 [2022-07-13 11:32:08,421 INFO L226 Difference]: Without dead ends: 366 [2022-07-13 11:32:08,422 INFO L412 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 [2022-07-13 11:32:08,423 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 155 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:08,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 161 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-13 11:32:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 358. [2022-07-13 11:32:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.6246498599439776) internal successors, (580), 357 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 580 transitions. [2022-07-13 11:32:08,431 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 580 transitions. Word has length 98 [2022-07-13 11:32:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:08,432 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 580 transitions. [2022-07-13 11:32:08,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 580 transitions. [2022-07-13 11:32:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 11:32:08,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:08,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:08,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:32:08,435 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 438851098, now seen corresponding path program 1 times [2022-07-13 11:32:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:08,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618983142] [2022-07-13 11:32:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:08,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:32:08,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618983142] [2022-07-13 11:32:08,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618983142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:08,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:08,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:08,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899019165] [2022-07-13 11:32:08,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:08,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:08,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:08,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:08,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:08,458 INFO L87 Difference]: Start difference. First operand 358 states and 580 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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) [2022-07-13 11:32:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:08,538 INFO L93 Difference]: Finished difference Result 716 states and 1161 transitions. [2022-07-13 11:32:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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 99 [2022-07-13 11:32:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:08,540 INFO L225 Difference]: With dead ends: 716 [2022-07-13 11:32:08,540 INFO L226 Difference]: Without dead ends: 366 [2022-07-13 11:32:08,540 INFO L412 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 [2022-07-13 11:32:08,541 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 154 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:08,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 161 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-13 11:32:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 358. [2022-07-13 11:32:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.6106442577030813) internal successors, (575), 357 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 575 transitions. [2022-07-13 11:32:08,551 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 575 transitions. Word has length 99 [2022-07-13 11:32:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:08,552 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 575 transitions. [2022-07-13 11:32:08,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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) [2022-07-13 11:32:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 575 transitions. [2022-07-13 11:32:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:32:08,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:08,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:08,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:32:08,553 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:08,554 INFO L85 PathProgramCache]: Analyzing trace with hash -454878444, now seen corresponding path program 1 times [2022-07-13 11:32:08,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:08,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993874398] [2022-07-13 11:32:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 11:32:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:08,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993874398] [2022-07-13 11:32:08,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993874398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:08,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:08,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783825191] [2022-07-13 11:32:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:08,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:08,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:08,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:08,586 INFO L87 Difference]: Start difference. First operand 358 states and 575 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) [2022-07-13 11:32:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:08,670 INFO L93 Difference]: Finished difference Result 744 states and 1196 transitions. [2022-07-13 11:32:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:08,670 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 106 [2022-07-13 11:32:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:08,672 INFO L225 Difference]: With dead ends: 744 [2022-07-13 11:32:08,672 INFO L226 Difference]: Without dead ends: 394 [2022-07-13 11:32:08,672 INFO L412 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 [2022-07-13 11:32:08,673 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 146 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:08,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 155 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-07-13 11:32:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2022-07-13 11:32:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.60613810741688) internal successors, (628), 391 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 628 transitions. [2022-07-13 11:32:08,683 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 628 transitions. Word has length 106 [2022-07-13 11:32:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:08,683 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 628 transitions. [2022-07-13 11:32:08,683 INFO L496 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) [2022-07-13 11:32:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 628 transitions. [2022-07-13 11:32:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 11:32:08,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:08,684 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:08,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:32:08,685 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:08,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1573380214, now seen corresponding path program 1 times [2022-07-13 11:32:08,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:08,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328242688] [2022-07-13 11:32:08,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 11:32:08,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:08,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328242688] [2022-07-13 11:32:08,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328242688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:08,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:08,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391739721] [2022-07-13 11:32:08,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:08,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:08,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:08,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:08,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:08,716 INFO L87 Difference]: Start difference. First operand 392 states and 628 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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) [2022-07-13 11:32:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:08,805 INFO L93 Difference]: Finished difference Result 778 states and 1246 transitions. [2022-07-13 11:32:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:08,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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 107 [2022-07-13 11:32:08,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:08,807 INFO L225 Difference]: With dead ends: 778 [2022-07-13 11:32:08,807 INFO L226 Difference]: Without dead ends: 394 [2022-07-13 11:32:08,808 INFO L412 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 [2022-07-13 11:32:08,808 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 145 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:08,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 155 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-07-13 11:32:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2022-07-13 11:32:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.5984654731457801) internal successors, (625), 391 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 625 transitions. [2022-07-13 11:32:08,820 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 625 transitions. Word has length 107 [2022-07-13 11:32:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:08,820 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 625 transitions. [2022-07-13 11:32:08,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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) [2022-07-13 11:32:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 625 transitions. [2022-07-13 11:32:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 11:32:08,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:08,822 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:08,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:32:08,822 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1323147388, now seen corresponding path program 1 times [2022-07-13 11:32:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:08,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246539978] [2022-07-13 11:32:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:08,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:32:08,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:08,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246539978] [2022-07-13 11:32:08,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246539978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:08,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:08,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097083143] [2022-07-13 11:32:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:08,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:08,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:08,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:08,846 INFO L87 Difference]: Start difference. First operand 392 states and 625 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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) [2022-07-13 11:32:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:08,950 INFO L93 Difference]: Finished difference Result 823 states and 1312 transitions. [2022-07-13 11:32:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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 112 [2022-07-13 11:32:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:08,951 INFO L225 Difference]: With dead ends: 823 [2022-07-13 11:32:08,952 INFO L226 Difference]: Without dead ends: 439 [2022-07-13 11:32:08,953 INFO L412 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 [2022-07-13 11:32:08,954 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 133 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:08,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 166 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-07-13 11:32:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2022-07-13 11:32:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.5935334872979214) internal successors, (690), 433 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 690 transitions. [2022-07-13 11:32:08,965 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 690 transitions. Word has length 112 [2022-07-13 11:32:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:08,965 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 690 transitions. [2022-07-13 11:32:08,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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) [2022-07-13 11:32:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 690 transitions. [2022-07-13 11:32:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-13 11:32:08,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:08,966 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:08,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:32:08,967 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:08,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash -585535010, now seen corresponding path program 1 times [2022-07-13 11:32:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:08,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437822451] [2022-07-13 11:32:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 11:32:08,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:08,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437822451] [2022-07-13 11:32:08,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437822451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:08,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:08,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:08,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573951469] [2022-07-13 11:32:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:08,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:08,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:08,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:08,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:08,999 INFO L87 Difference]: Start difference. First operand 434 states and 690 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:09,097 INFO L93 Difference]: Finished difference Result 869 states and 1383 transitions. [2022-07-13 11:32:09,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 113 [2022-07-13 11:32:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:09,099 INFO L225 Difference]: With dead ends: 869 [2022-07-13 11:32:09,099 INFO L226 Difference]: Without dead ends: 441 [2022-07-13 11:32:09,100 INFO L412 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 [2022-07-13 11:32:09,100 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 133 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:09,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 165 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-07-13 11:32:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 436. [2022-07-13 11:32:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.5931034482758621) internal successors, (693), 435 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 693 transitions. [2022-07-13 11:32:09,110 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 693 transitions. Word has length 113 [2022-07-13 11:32:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:09,110 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 693 transitions. [2022-07-13 11:32:09,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 693 transitions. [2022-07-13 11:32:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 11:32:09,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:09,112 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:09,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:32:09,112 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1128262344, now seen corresponding path program 1 times [2022-07-13 11:32:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:09,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744059905] [2022-07-13 11:32:09,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-13 11:32:09,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:09,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744059905] [2022-07-13 11:32:09,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744059905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:09,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:09,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259414321] [2022-07-13 11:32:09,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:09,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:09,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:09,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:09,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:09,138 INFO L87 Difference]: Start difference. First operand 436 states and 693 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) [2022-07-13 11:32:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:09,223 INFO L93 Difference]: Finished difference Result 902 states and 1438 transitions. [2022-07-13 11:32:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:09,224 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 124 [2022-07-13 11:32:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:09,225 INFO L225 Difference]: With dead ends: 902 [2022-07-13 11:32:09,225 INFO L226 Difference]: Without dead ends: 474 [2022-07-13 11:32:09,226 INFO L412 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 [2022-07-13 11:32:09,227 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 157 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:09,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 172 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-13 11:32:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 461. [2022-07-13 11:32:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.5826086956521739) internal successors, (728), 460 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 728 transitions. [2022-07-13 11:32:09,236 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 728 transitions. Word has length 124 [2022-07-13 11:32:09,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:09,237 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 728 transitions. [2022-07-13 11:32:09,237 INFO L496 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) [2022-07-13 11:32:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 728 transitions. [2022-07-13 11:32:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 11:32:09,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:09,238 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:09,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:32:09,238 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:09,239 INFO L85 PathProgramCache]: Analyzing trace with hash -370099121, now seen corresponding path program 1 times [2022-07-13 11:32:09,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:09,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977090704] [2022-07-13 11:32:09,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-13 11:32:09,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:09,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977090704] [2022-07-13 11:32:09,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977090704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:09,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:09,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:09,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022049074] [2022-07-13 11:32:09,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:09,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:09,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:09,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:09,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:09,261 INFO L87 Difference]: Start difference. First operand 461 states and 728 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:09,345 INFO L93 Difference]: Finished difference Result 927 states and 1465 transitions. [2022-07-13 11:32:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:09,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 125 [2022-07-13 11:32:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:09,347 INFO L225 Difference]: With dead ends: 927 [2022-07-13 11:32:09,348 INFO L226 Difference]: Without dead ends: 474 [2022-07-13 11:32:09,350 INFO L412 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 [2022-07-13 11:32:09,350 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 156 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:09,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 172 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-13 11:32:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 461. [2022-07-13 11:32:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.565217391304348) internal successors, (720), 460 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 720 transitions. [2022-07-13 11:32:09,359 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 720 transitions. Word has length 125 [2022-07-13 11:32:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:09,360 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 720 transitions. [2022-07-13 11:32:09,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 720 transitions. [2022-07-13 11:32:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 11:32:09,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:09,361 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-13 11:32:09,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:32:09,362 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash -947882498, now seen corresponding path program 1 times [2022-07-13 11:32:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:09,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54072047] [2022-07-13 11:32:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-13 11:32:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54072047] [2022-07-13 11:32:09,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54072047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:09,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:09,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974534289] [2022-07-13 11:32:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:09,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:09,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:09,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:09,384 INFO L87 Difference]: Start difference. First operand 461 states and 720 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:09,486 INFO L93 Difference]: Finished difference Result 918 states and 1433 transitions. [2022-07-13 11:32:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:09,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 137 [2022-07-13 11:32:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:09,488 INFO L225 Difference]: With dead ends: 918 [2022-07-13 11:32:09,488 INFO L226 Difference]: Without dead ends: 465 [2022-07-13 11:32:09,489 INFO L412 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 [2022-07-13 11:32:09,489 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 147 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:09,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 158 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-07-13 11:32:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 461. [2022-07-13 11:32:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.5543478260869565) internal successors, (715), 460 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 715 transitions. [2022-07-13 11:32:09,499 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 715 transitions. Word has length 137 [2022-07-13 11:32:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:09,499 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 715 transitions. [2022-07-13 11:32:09,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 715 transitions. [2022-07-13 11:32:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 11:32:09,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:09,501 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-13 11:32:09,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:32:09,501 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1089840060, now seen corresponding path program 1 times [2022-07-13 11:32:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:09,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923526620] [2022-07-13 11:32:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-13 11:32:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:09,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923526620] [2022-07-13 11:32:09,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923526620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:09,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:09,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:09,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122388531] [2022-07-13 11:32:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:09,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:09,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:09,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:09,542 INFO L87 Difference]: Start difference. First operand 461 states and 715 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) [2022-07-13 11:32:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:09,643 INFO L93 Difference]: Finished difference Result 918 states and 1423 transitions. [2022-07-13 11:32:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:09,643 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 138 [2022-07-13 11:32:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:09,645 INFO L225 Difference]: With dead ends: 918 [2022-07-13 11:32:09,645 INFO L226 Difference]: Without dead ends: 465 [2022-07-13 11:32:09,645 INFO L412 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 [2022-07-13 11:32:09,646 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 145 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:09,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 159 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-07-13 11:32:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 461. [2022-07-13 11:32:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.5434782608695652) internal successors, (710), 460 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 710 transitions. [2022-07-13 11:32:09,655 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 710 transitions. Word has length 138 [2022-07-13 11:32:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:09,655 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 710 transitions. [2022-07-13 11:32:09,655 INFO L496 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) [2022-07-13 11:32:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 710 transitions. [2022-07-13 11:32:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-13 11:32:09,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:09,657 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:09,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:32:09,657 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash 215230978, now seen corresponding path program 1 times [2022-07-13 11:32:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:09,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369545773] [2022-07-13 11:32:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-13 11:32:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369545773] [2022-07-13 11:32:09,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369545773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:09,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:09,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:09,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310207916] [2022-07-13 11:32:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:09,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:09,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:09,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:09,683 INFO L87 Difference]: Start difference. First operand 461 states and 710 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) [2022-07-13 11:32:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:09,753 INFO L93 Difference]: Finished difference Result 942 states and 1453 transitions. [2022-07-13 11:32:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:09,753 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 145 [2022-07-13 11:32:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:09,755 INFO L225 Difference]: With dead ends: 942 [2022-07-13 11:32:09,755 INFO L226 Difference]: Without dead ends: 489 [2022-07-13 11:32:09,756 INFO L412 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 [2022-07-13 11:32:09,756 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 159 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:09,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 157 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-07-13 11:32:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 485. [2022-07-13 11:32:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.53099173553719) internal successors, (741), 484 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 741 transitions. [2022-07-13 11:32:09,767 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 741 transitions. Word has length 145 [2022-07-13 11:32:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:09,767 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 741 transitions. [2022-07-13 11:32:09,767 INFO L496 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) [2022-07-13 11:32:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 741 transitions. [2022-07-13 11:32:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-13 11:32:09,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:09,768 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:09,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:32:09,769 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:09,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:09,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1021186181, now seen corresponding path program 1 times [2022-07-13 11:32:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:09,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704277870] [2022-07-13 11:32:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:09,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-13 11:32:09,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:09,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704277870] [2022-07-13 11:32:09,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704277870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:09,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:09,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:09,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563905025] [2022-07-13 11:32:09,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:09,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:09,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:09,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:09,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:09,796 INFO L87 Difference]: Start difference. First operand 485 states and 741 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:09,891 INFO L93 Difference]: Finished difference Result 966 states and 1475 transitions. [2022-07-13 11:32:09,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:09,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 146 [2022-07-13 11:32:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:09,893 INFO L225 Difference]: With dead ends: 966 [2022-07-13 11:32:09,893 INFO L226 Difference]: Without dead ends: 489 [2022-07-13 11:32:09,894 INFO L412 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 [2022-07-13 11:32:09,895 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 158 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:09,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 156 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-07-13 11:32:09,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 485. [2022-07-13 11:32:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.512396694214876) internal successors, (732), 484 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 732 transitions. [2022-07-13 11:32:09,906 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 732 transitions. Word has length 146 [2022-07-13 11:32:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:09,906 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 732 transitions. [2022-07-13 11:32:09,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 732 transitions. [2022-07-13 11:32:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-13 11:32:09,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:09,908 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:09,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:32:09,908 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1311037116, now seen corresponding path program 1 times [2022-07-13 11:32:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:09,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394462510] [2022-07-13 11:32:09,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 11:32:09,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:09,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394462510] [2022-07-13 11:32:09,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394462510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:09,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:09,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499757104] [2022-07-13 11:32:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:09,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:09,932 INFO L87 Difference]: Start difference. First operand 485 states and 732 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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) [2022-07-13 11:32:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:10,065 INFO L93 Difference]: Finished difference Result 1009 states and 1518 transitions. [2022-07-13 11:32:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:10,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 152 [2022-07-13 11:32:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:10,067 INFO L225 Difference]: With dead ends: 1009 [2022-07-13 11:32:10,067 INFO L226 Difference]: Without dead ends: 532 [2022-07-13 11:32:10,067 INFO L412 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 [2022-07-13 11:32:10,068 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 130 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:10,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 176 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-13 11:32:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 526. [2022-07-13 11:32:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.499047619047619) internal successors, (787), 525 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 787 transitions. [2022-07-13 11:32:10,081 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 787 transitions. Word has length 152 [2022-07-13 11:32:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:10,081 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 787 transitions. [2022-07-13 11:32:10,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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) [2022-07-13 11:32:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 787 transitions. [2022-07-13 11:32:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 11:32:10,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:10,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:10,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:32:10,083 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash -102218426, now seen corresponding path program 1 times [2022-07-13 11:32:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:10,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001873320] [2022-07-13 11:32:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 11:32:10,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:10,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001873320] [2022-07-13 11:32:10,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001873320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:10,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:10,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020901183] [2022-07-13 11:32:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:10,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:10,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:10,109 INFO L87 Difference]: Start difference. First operand 526 states and 787 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:10,198 INFO L93 Difference]: Finished difference Result 1050 states and 1571 transitions. [2022-07-13 11:32:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:10,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 153 [2022-07-13 11:32:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:10,200 INFO L225 Difference]: With dead ends: 1050 [2022-07-13 11:32:10,200 INFO L226 Difference]: Without dead ends: 513 [2022-07-13 11:32:10,201 INFO L412 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 [2022-07-13 11:32:10,201 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 129 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:10,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 172 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-13 11:32:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 507. [2022-07-13 11:32:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.4960474308300395) internal successors, (757), 506 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 757 transitions. [2022-07-13 11:32:10,215 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 757 transitions. Word has length 153 [2022-07-13 11:32:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:10,215 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 757 transitions. [2022-07-13 11:32:10,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 757 transitions. [2022-07-13 11:32:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-13 11:32:10,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:10,217 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:10,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:32:10,217 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1626698986, now seen corresponding path program 1 times [2022-07-13 11:32:10,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:10,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229136772] [2022-07-13 11:32:10,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:10,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-07-13 11:32:10,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:10,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229136772] [2022-07-13 11:32:10,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229136772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:10,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:10,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050421337] [2022-07-13 11:32:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:10,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:10,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:10,240 INFO L87 Difference]: Start difference. First operand 507 states and 757 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:10,312 INFO L93 Difference]: Finished difference Result 1031 states and 1543 transitions. [2022-07-13 11:32:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:10,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 166 [2022-07-13 11:32:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:10,314 INFO L225 Difference]: With dead ends: 1031 [2022-07-13 11:32:10,314 INFO L226 Difference]: Without dead ends: 532 [2022-07-13 11:32:10,315 INFO L412 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 [2022-07-13 11:32:10,315 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 161 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:10,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 156 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-13 11:32:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2022-07-13 11:32:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.4819734345351043) internal successors, (781), 527 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 781 transitions. [2022-07-13 11:32:10,327 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 781 transitions. Word has length 166 [2022-07-13 11:32:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:10,327 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 781 transitions. [2022-07-13 11:32:10,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 781 transitions. [2022-07-13 11:32:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-13 11:32:10,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:10,329 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:10,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:32:10,329 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash -215065955, now seen corresponding path program 1 times [2022-07-13 11:32:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:10,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820371278] [2022-07-13 11:32:10,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:10,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-07-13 11:32:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:10,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820371278] [2022-07-13 11:32:10,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820371278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:10,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:10,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339703348] [2022-07-13 11:32:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:10,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:10,351 INFO L87 Difference]: Start difference. First operand 528 states and 781 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:10,425 INFO L93 Difference]: Finished difference Result 1052 states and 1556 transitions. [2022-07-13 11:32:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:10,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 167 [2022-07-13 11:32:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:10,427 INFO L225 Difference]: With dead ends: 1052 [2022-07-13 11:32:10,427 INFO L226 Difference]: Without dead ends: 530 [2022-07-13 11:32:10,428 INFO L412 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 [2022-07-13 11:32:10,428 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 160 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:10,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 156 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-07-13 11:32:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 526. [2022-07-13 11:32:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.460952380952381) internal successors, (767), 525 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 767 transitions. [2022-07-13 11:32:10,441 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 767 transitions. Word has length 167 [2022-07-13 11:32:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:10,441 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 767 transitions. [2022-07-13 11:32:10,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 767 transitions. [2022-07-13 11:32:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-13 11:32:10,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:10,443 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:10,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:32:10,443 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:10,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash -36033930, now seen corresponding path program 1 times [2022-07-13 11:32:10,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:10,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186153785] [2022-07-13 11:32:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:10,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-13 11:32:10,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:10,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186153785] [2022-07-13 11:32:10,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186153785] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:32:10,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849128826] [2022-07-13 11:32:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:10,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:32:10,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:32:10,481 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) [2022-07-13 11:32:10,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:32:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:10,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:32:10,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:32:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-07-13 11:32:10,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:32:10,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849128826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:10,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:32:10,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-13 11:32:10,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945153789] [2022-07-13 11:32:10,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:10,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:10,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:10,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:10,778 INFO L87 Difference]: Start difference. First operand 526 states and 767 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) [2022-07-13 11:32:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:10,821 INFO L93 Difference]: Finished difference Result 1560 states and 2276 transitions. [2022-07-13 11:32:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:10,822 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 182 [2022-07-13 11:32:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:10,825 INFO L225 Difference]: With dead ends: 1560 [2022-07-13 11:32:10,825 INFO L226 Difference]: Without dead ends: 1042 [2022-07-13 11:32:10,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:10,826 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 134 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:10,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 382 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-07-13 11:32:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-07-13 11:32:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 1.4534101825168109) internal successors, (1513), 1041 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1513 transitions. [2022-07-13 11:32:10,849 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1513 transitions. Word has length 182 [2022-07-13 11:32:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:10,850 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 1513 transitions. [2022-07-13 11:32:10,850 INFO L496 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) [2022-07-13 11:32:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1513 transitions. [2022-07-13 11:32:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-13 11:32:10,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:10,852 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:10,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:32:11,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 11:32:11,069 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash -148641518, now seen corresponding path program 1 times [2022-07-13 11:32:11,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:11,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343166944] [2022-07-13 11:32:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:11,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-13 11:32:11,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:11,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343166944] [2022-07-13 11:32:11,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343166944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:11,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:11,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:11,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273309392] [2022-07-13 11:32:11,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:11,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:11,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:11,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:11,102 INFO L87 Difference]: Start difference. First operand 1042 states and 1513 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:11,158 INFO L93 Difference]: Finished difference Result 2586 states and 3759 transitions. [2022-07-13 11:32:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:11,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 189 [2022-07-13 11:32:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:11,163 INFO L225 Difference]: With dead ends: 2586 [2022-07-13 11:32:11,163 INFO L226 Difference]: Without dead ends: 1552 [2022-07-13 11:32:11,164 INFO L412 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 [2022-07-13 11:32:11,165 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:11,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 557 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2022-07-13 11:32:11,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2022-07-13 11:32:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 1.4500322372662797) internal successors, (2249), 1551 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2249 transitions. [2022-07-13 11:32:11,217 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2249 transitions. Word has length 189 [2022-07-13 11:32:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:11,218 INFO L495 AbstractCegarLoop]: Abstraction has 1552 states and 2249 transitions. [2022-07-13 11:32:11,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2249 transitions. [2022-07-13 11:32:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-13 11:32:11,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:11,223 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:11,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:32:11,223 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1610414397, now seen corresponding path program 1 times [2022-07-13 11:32:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:11,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397328979] [2022-07-13 11:32:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:11,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-13 11:32:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:11,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397328979] [2022-07-13 11:32:11,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397328979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:11,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:11,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:11,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525727361] [2022-07-13 11:32:11,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:11,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:11,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:11,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:11,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:11,270 INFO L87 Difference]: Start difference. First operand 1552 states and 2249 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:11,334 INFO L93 Difference]: Finished difference Result 3607 states and 5232 transitions. [2022-07-13 11:32:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:11,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 190 [2022-07-13 11:32:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:11,341 INFO L225 Difference]: With dead ends: 3607 [2022-07-13 11:32:11,341 INFO L226 Difference]: Without dead ends: 2063 [2022-07-13 11:32:11,344 INFO L412 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 [2022-07-13 11:32:11,344 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:11,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 555 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2022-07-13 11:32:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2063. [2022-07-13 11:32:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 2062 states have (on average 1.4481086323957324) internal successors, (2986), 2062 states have internal predecessors, (2986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2986 transitions. [2022-07-13 11:32:11,396 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2986 transitions. Word has length 190 [2022-07-13 11:32:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:11,397 INFO L495 AbstractCegarLoop]: Abstraction has 2063 states and 2986 transitions. [2022-07-13 11:32:11,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2986 transitions. [2022-07-13 11:32:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2022-07-13 11:32:11,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:11,402 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:11,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:32:11,402 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1297591734, now seen corresponding path program 1 times [2022-07-13 11:32:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:11,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189526069] [2022-07-13 11:32:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-07-13 11:32:11,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:11,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189526069] [2022-07-13 11:32:11,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189526069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:11,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:11,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339890110] [2022-07-13 11:32:11,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:11,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:11,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:11,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:11,448 INFO L87 Difference]: Start difference. First operand 2063 states and 2986 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:11,524 INFO L93 Difference]: Finished difference Result 5693 states and 8230 transitions. [2022-07-13 11:32:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:11,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 339 [2022-07-13 11:32:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:11,535 INFO L225 Difference]: With dead ends: 5693 [2022-07-13 11:32:11,535 INFO L226 Difference]: Without dead ends: 3638 [2022-07-13 11:32:11,538 INFO L412 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 [2022-07-13 11:32:11,539 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 135 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:11,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 551 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2022-07-13 11:32:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3636. [2022-07-13 11:32:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 3635 states have (on average 1.443191196698762) internal successors, (5246), 3635 states have internal predecessors, (5246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5246 transitions. [2022-07-13 11:32:11,636 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5246 transitions. Word has length 339 [2022-07-13 11:32:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:11,636 INFO L495 AbstractCegarLoop]: Abstraction has 3636 states and 5246 transitions. [2022-07-13 11:32:11,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5246 transitions. [2022-07-13 11:32:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-07-13 11:32:11,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:11,644 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:11,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 11:32:11,644 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash 749660294, now seen corresponding path program 1 times [2022-07-13 11:32:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:11,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492078252] [2022-07-13 11:32:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 840 proven. 66 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-07-13 11:32:11,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:11,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492078252] [2022-07-13 11:32:11,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492078252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:32:11,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046037212] [2022-07-13 11:32:11,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:11,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:32:11,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:32:11,690 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:32:11,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:32:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:11,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:32:11,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:32:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2022-07-13 11:32:11,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:32:11,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046037212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:11,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:32:11,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-13 11:32:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134259764] [2022-07-13 11:32:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:11,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:11,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:11,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:11,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:11,879 INFO L87 Difference]: Start difference. First operand 3636 states and 5246 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:12,019 INFO L93 Difference]: Finished difference Result 8269 states and 11945 transitions. [2022-07-13 11:32:12,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:12,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 376 [2022-07-13 11:32:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:12,033 INFO L225 Difference]: With dead ends: 8269 [2022-07-13 11:32:12,034 INFO L226 Difference]: Without dead ends: 4641 [2022-07-13 11:32:12,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:12,039 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 152 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:12,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 364 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2022-07-13 11:32:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 4641. [2022-07-13 11:32:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4641 states, 4640 states have (on average 1.4450431034482758) internal successors, (6705), 4640 states have internal predecessors, (6705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 6705 transitions. [2022-07-13 11:32:12,156 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 6705 transitions. Word has length 376 [2022-07-13 11:32:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:12,157 INFO L495 AbstractCegarLoop]: Abstraction has 4641 states and 6705 transitions. [2022-07-13 11:32:12,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 6705 transitions. [2022-07-13 11:32:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2022-07-13 11:32:12,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:12,168 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:12,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:32:12,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-13 11:32:12,385 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1557445148, now seen corresponding path program 1 times [2022-07-13 11:32:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:12,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141341711] [2022-07-13 11:32:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1707 proven. 66 refuted. 0 times theorem prover too weak. 1517 trivial. 0 not checked. [2022-07-13 11:32:12,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:12,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141341711] [2022-07-13 11:32:12,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141341711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:32:12,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051379696] [2022-07-13 11:32:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:12,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:32:12,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:32:12,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:32:12,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:32:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:12,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:32:12,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:32:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1718 proven. 0 refuted. 0 times theorem prover too weak. 1572 trivial. 0 not checked. [2022-07-13 11:32:12,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:32:12,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051379696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:12,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:32:12,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-13 11:32:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936978824] [2022-07-13 11:32:12,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:12,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:12,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:12,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:12,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:12,627 INFO L87 Difference]: Start difference. First operand 4641 states and 6705 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:12,777 INFO L93 Difference]: Finished difference Result 9474 states and 13718 transitions. [2022-07-13 11:32:12,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:12,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 566 [2022-07-13 11:32:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:12,786 INFO L225 Difference]: With dead ends: 9474 [2022-07-13 11:32:12,786 INFO L226 Difference]: Without dead ends: 3012 [2022-07-13 11:32:12,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:12,793 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:12,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 321 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2022-07-13 11:32:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 3012. [2022-07-13 11:32:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 3011 states have (on average 1.4224510129525074) internal successors, (4283), 3011 states have internal predecessors, (4283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 4283 transitions. [2022-07-13 11:32:12,892 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 4283 transitions. Word has length 566 [2022-07-13 11:32:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:12,892 INFO L495 AbstractCegarLoop]: Abstraction has 3012 states and 4283 transitions. [2022-07-13 11:32:12,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 4283 transitions. [2022-07-13 11:32:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2022-07-13 11:32:12,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:12,902 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:12,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:32:13,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:32:13,121 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1280802965, now seen corresponding path program 1 times [2022-07-13 11:32:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:13,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981334583] [2022-07-13 11:32:13,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-07-13 11:32:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981334583] [2022-07-13 11:32:13,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981334583] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:32:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361457821] [2022-07-13 11:32:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:13,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:32:13,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:32:13,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:32:13,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:32:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:13,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:32:13,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:32:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1193 proven. 0 refuted. 0 times theorem prover too weak. 2456 trivial. 0 not checked. [2022-07-13 11:32:13,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:32:13,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361457821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:13,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:32:13,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-13 11:32:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950920832] [2022-07-13 11:32:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:13,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:13,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:13,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:13,737 INFO L87 Difference]: Start difference. First operand 3012 states and 4283 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:13,803 INFO L93 Difference]: Finished difference Result 3072 states and 4369 transitions. [2022-07-13 11:32:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:13,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 595 [2022-07-13 11:32:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:13,808 INFO L225 Difference]: With dead ends: 3072 [2022-07-13 11:32:13,808 INFO L226 Difference]: Without dead ends: 2583 [2022-07-13 11:32:13,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:13,810 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 104 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:13,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 318 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2022-07-13 11:32:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2525. [2022-07-13 11:32:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2524 states have (on average 1.4235340729001584) internal successors, (3593), 2524 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 3593 transitions. [2022-07-13 11:32:13,866 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 3593 transitions. Word has length 595 [2022-07-13 11:32:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:13,867 INFO L495 AbstractCegarLoop]: Abstraction has 2525 states and 3593 transitions. [2022-07-13 11:32:13,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 3593 transitions. [2022-07-13 11:32:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2022-07-13 11:32:13,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:13,872 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:13,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:32:14,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:32:14,091 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:14,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash -326862807, now seen corresponding path program 1 times [2022-07-13 11:32:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:14,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917174629] [2022-07-13 11:32:14,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:14,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-07-13 11:32:14,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:14,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917174629] [2022-07-13 11:32:14,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917174629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:32:14,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583095138] [2022-07-13 11:32:14,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:14,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:32:14,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:32:14,150 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:32:14,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:32:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:14,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:32:14,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:32:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-07-13 11:32:14,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:32:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-07-13 11:32:14,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583095138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:32:14,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:32:14,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-13 11:32:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075752849] [2022-07-13 11:32:14,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:32:14,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:32:14,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:14,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:32:14,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:32:14,427 INFO L87 Difference]: Start difference. First operand 2525 states and 3593 transitions. Second operand has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:14,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:14,645 INFO L93 Difference]: Finished difference Result 5094 states and 7246 transitions. [2022-07-13 11:32:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:32:14,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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 595 [2022-07-13 11:32:14,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:14,650 INFO L225 Difference]: With dead ends: 5094 [2022-07-13 11:32:14,650 INFO L226 Difference]: Without dead ends: 2522 [2022-07-13 11:32:14,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1196 GetRequests, 1190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:32:14,654 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 650 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:14,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 350 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-07-13 11:32:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2292. [2022-07-13 11:32:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2292 states, 2291 states have (on average 1.358795285901353) internal successors, (3113), 2291 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 3113 transitions. [2022-07-13 11:32:14,718 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 3113 transitions. Word has length 595 [2022-07-13 11:32:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:14,718 INFO L495 AbstractCegarLoop]: Abstraction has 2292 states and 3113 transitions. [2022-07-13 11:32:14,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 3113 transitions. [2022-07-13 11:32:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2022-07-13 11:32:14,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:14,730 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:14,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 11:32:14,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-13 11:32:14,950 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2092146357, now seen corresponding path program 1 times [2022-07-13 11:32:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935034461] [2022-07-13 11:32:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-07-13 11:32:15,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:15,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935034461] [2022-07-13 11:32:15,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935034461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:32:15,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274701688] [2022-07-13 11:32:15,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:15,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:32:15,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:32:15,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:32:15,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:32:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:15,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:32:15,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:32:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-07-13 11:32:15,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:32:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-07-13 11:32:15,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274701688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:32:15,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:32:15,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-13 11:32:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288300830] [2022-07-13 11:32:15,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:32:15,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:32:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:15,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:32:15,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:32:15,461 INFO L87 Difference]: Start difference. First operand 2292 states and 3113 transitions. Second operand has 8 states, 8 states have (on average 44.0) internal successors, (352), 8 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:15,815 INFO L93 Difference]: Finished difference Result 6930 states and 9569 transitions. [2022-07-13 11:32:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:32:15,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.0) internal successors, (352), 8 states have internal predecessors, (352), 0 states have call successors, (0), 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 1015 [2022-07-13 11:32:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:15,823 INFO L225 Difference]: With dead ends: 6930 [2022-07-13 11:32:15,823 INFO L226 Difference]: Without dead ends: 4457 [2022-07-13 11:32:15,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2038 GetRequests, 2029 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:32:15,827 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 364 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:15,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 844 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:32:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2022-07-13 11:32:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 2612. [2022-07-13 11:32:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2611 states have (on average 1.3780160857908847) internal successors, (3598), 2611 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3598 transitions. [2022-07-13 11:32:15,898 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3598 transitions. Word has length 1015 [2022-07-13 11:32:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:15,899 INFO L495 AbstractCegarLoop]: Abstraction has 2612 states and 3598 transitions. [2022-07-13 11:32:15,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.0) internal successors, (352), 8 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3598 transitions. [2022-07-13 11:32:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2022-07-13 11:32:15,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:15,910 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 41, 41, 38, 38, 38, 34, 34, 30, 30, 26, 26, 22, 22, 22, 22, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:15,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:32:16,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:32:16,129 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:16,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1735176173, now seen corresponding path program 1 times [2022-07-13 11:32:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:16,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443261464] [2022-07-13 11:32:16,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:16,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 17466 backedges. 7796 proven. 0 refuted. 0 times theorem prover too weak. 9670 trivial. 0 not checked. [2022-07-13 11:32:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:16,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443261464] [2022-07-13 11:32:16,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443261464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:16,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:16,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448938899] [2022-07-13 11:32:16,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:16,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:16,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:16,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:16,291 INFO L87 Difference]: Start difference. First operand 2612 states and 3598 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:16,401 INFO L93 Difference]: Finished difference Result 5341 states and 7353 transitions. [2022-07-13 11:32:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:16,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1181 [2022-07-13 11:32:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:16,406 INFO L225 Difference]: With dead ends: 5341 [2022-07-13 11:32:16,406 INFO L226 Difference]: Without dead ends: 2713 [2022-07-13 11:32:16,408 INFO L412 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 [2022-07-13 11:32:16,409 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:16,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 306 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2022-07-13 11:32:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2668. [2022-07-13 11:32:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2667 states have (on average 1.3678290213723285) internal successors, (3648), 2667 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 3648 transitions. [2022-07-13 11:32:16,479 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 3648 transitions. Word has length 1181 [2022-07-13 11:32:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:16,479 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 3648 transitions. [2022-07-13 11:32:16,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 3648 transitions. [2022-07-13 11:32:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2022-07-13 11:32:16,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:16,490 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 38, 38, 38, 34, 34, 30, 30, 26, 26, 22, 22, 22, 22, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:32:16,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-13 11:32:16,491 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash -483097658, now seen corresponding path program 1 times [2022-07-13 11:32:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:16,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860142827] [2022-07-13 11:32:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:16,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17758 backedges. 7711 proven. 0 refuted. 0 times theorem prover too weak. 10047 trivial. 0 not checked. [2022-07-13 11:32:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:16,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860142827] [2022-07-13 11:32:16,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860142827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:16,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:16,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742544016] [2022-07-13 11:32:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:16,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:16,647 INFO L87 Difference]: Start difference. First operand 2668 states and 3648 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:16,732 INFO L93 Difference]: Finished difference Result 3798 states and 5179 transitions. [2022-07-13 11:32:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:16,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1196 [2022-07-13 11:32:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:16,733 INFO L225 Difference]: With dead ends: 3798 [2022-07-13 11:32:16,733 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 11:32:16,736 INFO L412 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 [2022-07-13 11:32:16,736 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 145 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:16,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 168 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 11:32:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 11:32:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 11:32:16,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1196 [2022-07-13 11:32:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:16,738 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 11:32:16,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 11:32:16,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 11:32:16,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:32:16,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-13 11:32:16,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 11:32:26,278 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 570) no Hoare annotation was computed. [2022-07-13 11:32:26,278 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 534) no Hoare annotation was computed. [2022-07-13 11:32:26,278 INFO L899 garLoopResultBuilder]: For program point L564-1(lines 564 570) no Hoare annotation was computed. [2022-07-13 11:32:26,288 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2022-07-13 11:32:26,288 INFO L895 garLoopResultBuilder]: At program point L201(lines 197 585) the Hoare annotation is: (let ((.cse10 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse19 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse21 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse8 .cse9 .cse11 .cse12 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse13 .cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse15 .cse16 .cse19 .cse20 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse21))) [2022-07-13 11:32:26,288 INFO L895 garLoopResultBuilder]: At program point L168(lines 164 596) the Hoare annotation is: (let ((.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse17 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse9 .cse10 .cse11 .cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse13 .cse14 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse17) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse16 .cse17))) [2022-07-13 11:32:26,288 INFO L895 garLoopResultBuilder]: At program point L135(lines 134 606) the Hoare annotation is: (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) [2022-07-13 11:32:26,288 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-07-13 11:32:26,288 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2022-07-13 11:32:26,289 INFO L899 garLoopResultBuilder]: For program point L500(lines 500 504) no Hoare annotation was computed. [2022-07-13 11:32:26,289 INFO L899 garLoopResultBuilder]: For program point L500-2(lines 500 504) no Hoare annotation was computed. [2022-07-13 11:32:26,289 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 583) no Hoare annotation was computed. [2022-07-13 11:32:26,289 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 594) no Hoare annotation was computed. [2022-07-13 11:32:26,289 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 605) no Hoare annotation was computed. [2022-07-13 11:32:26,289 INFO L902 garLoopResultBuilder]: At program point L633(lines 109 634) the Hoare annotation is: true [2022-07-13 11:32:26,289 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 569) no Hoare annotation was computed. [2022-07-13 11:32:26,289 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-07-13 11:32:26,289 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-07-13 11:32:26,289 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-07-13 11:32:26,290 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 219 576) no Hoare annotation was computed. [2022-07-13 11:32:26,290 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-07-13 11:32:26,290 INFO L899 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-07-13 11:32:26,290 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2022-07-13 11:32:26,290 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-07-13 11:32:26,290 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 582) no Hoare annotation was computed. [2022-07-13 11:32:26,290 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 593) no Hoare annotation was computed. [2022-07-13 11:32:26,290 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 604) no Hoare annotation was computed. [2022-07-13 11:32:26,291 INFO L895 garLoopResultBuilder]: At program point L207(lines 203 583) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse23 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse24 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse25 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse24 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse25) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2022-07-13 11:32:26,291 INFO L895 garLoopResultBuilder]: At program point L174(lines 170 594) the Hoare annotation is: (let ((.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse16 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 .cse9 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse14 .cse15 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse17 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse17))) [2022-07-13 11:32:26,291 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 640) no Hoare annotation was computed. [2022-07-13 11:32:26,291 INFO L899 garLoopResultBuilder]: For program point L638-2(lines 638 640) no Hoare annotation was computed. [2022-07-13 11:32:26,291 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 549) no Hoare annotation was computed. [2022-07-13 11:32:26,291 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-07-13 11:32:26,291 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2022-07-13 11:32:26,291 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 581) no Hoare annotation was computed. [2022-07-13 11:32:26,291 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 592) no Hoare annotation was computed. [2022-07-13 11:32:26,292 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 603) no Hoare annotation was computed. [2022-07-13 11:32:26,292 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 632) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse2 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) .cse0 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse2 .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse2 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1))) [2022-07-13 11:32:26,292 INFO L895 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse17 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse9 .cse10 .cse11 .cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse13 .cse14 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse17) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse16 .cse17))) [2022-07-13 11:32:26,292 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-07-13 11:32:26,292 INFO L895 garLoopResultBuilder]: At program point L177(lines 176 592) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse14 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609)) .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) .cse4 .cse5 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641)) .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse8 .cse9 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse10 (not .cse11) .cse12) (and (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse3 .cse4 .cse5 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse6 .cse7 .cse8 .cse11 .cse9 .cse10 .cse12) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse13 .cse14 .cse15))) [2022-07-13 11:32:26,292 INFO L895 garLoopResultBuilder]: At program point L144(lines 137 605) the Hoare annotation is: (let ((.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse13 .cse14) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609)) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) .cse6 .cse7 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641)) .cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse10 .cse11 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse14))) [2022-07-13 11:32:26,293 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-13 11:32:26,293 INFO L899 garLoopResultBuilder]: For program point L542(lines 542 548) no Hoare annotation was computed. [2022-07-13 11:32:26,293 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2022-07-13 11:32:26,293 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2022-07-13 11:32:26,293 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 580) no Hoare annotation was computed. [2022-07-13 11:32:26,293 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 591) no Hoare annotation was computed. [2022-07-13 11:32:26,293 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 602) no Hoare annotation was computed. [2022-07-13 11:32:26,293 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 613) no Hoare annotation was computed. [2022-07-13 11:32:26,293 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 513) no Hoare annotation was computed. [2022-07-13 11:32:26,294 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-07-13 11:32:26,294 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2022-07-13 11:32:26,294 INFO L899 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2022-07-13 11:32:26,294 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 581) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse11 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse24 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse21 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse22 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse23 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse23) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23))) [2022-07-13 11:32:26,294 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 613) the Hoare annotation is: (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) [2022-07-13 11:32:26,294 INFO L902 garLoopResultBuilder]: At program point L643(lines 22 645) the Hoare annotation is: true [2022-07-13 11:32:26,294 INFO L895 garLoopResultBuilder]: At program point L577(lines 110 632) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse2 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) .cse0 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse2 .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse2 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1))) [2022-07-13 11:32:26,295 INFO L899 garLoopResultBuilder]: For program point L545(lines 545 547) no Hoare annotation was computed. [2022-07-13 11:32:26,295 INFO L899 garLoopResultBuilder]: For program point L545-2(lines 219 576) no Hoare annotation was computed. [2022-07-13 11:32:26,295 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 579) no Hoare annotation was computed. [2022-07-13 11:32:26,295 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 590) no Hoare annotation was computed. [2022-07-13 11:32:26,295 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 601) no Hoare annotation was computed. [2022-07-13 11:32:26,295 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 612) no Hoare annotation was computed. [2022-07-13 11:32:26,295 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2022-07-13 11:32:26,295 INFO L899 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2022-07-13 11:32:26,295 INFO L895 garLoopResultBuilder]: At program point L216(lines 215 579) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) [2022-07-13 11:32:26,296 INFO L895 garLoopResultBuilder]: At program point L183(lines 179 591) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse11 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse19 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse21 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse22 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse23 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse24 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse17 .cse18 .cse21 .cse22 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse23) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) [2022-07-13 11:32:26,296 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 602) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse23 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse24 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse24) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse22 .cse23 .cse24))) [2022-07-13 11:32:26,296 INFO L899 garLoopResultBuilder]: For program point L614(lines 614 630) no Hoare annotation was computed. [2022-07-13 11:32:26,296 INFO L899 garLoopResultBuilder]: For program point L515(lines 515 525) no Hoare annotation was computed. [2022-07-13 11:32:26,296 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2022-07-13 11:32:26,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 11:32:26,296 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 579) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 589) no Hoare annotation was computed. [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 600) no Hoare annotation was computed. [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 611) no Hoare annotation was computed. [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 629) no Hoare annotation was computed. [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L285-2(lines 219 576) no Hoare annotation was computed. [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 621) no Hoare annotation was computed. [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L616-2(lines 615 629) no Hoare annotation was computed. [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-07-13 11:32:26,297 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-07-13 11:32:26,298 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 524) no Hoare annotation was computed. [2022-07-13 11:32:26,298 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2022-07-13 11:32:26,298 INFO L899 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2022-07-13 11:32:26,298 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-07-13 11:32:26,298 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 588) no Hoare annotation was computed. [2022-07-13 11:32:26,298 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 599) no Hoare annotation was computed. [2022-07-13 11:32:26,298 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 610) no Hoare annotation was computed. [2022-07-13 11:32:26,298 INFO L899 garLoopResultBuilder]: For program point L618(lines 618 620) no Hoare annotation was computed. [2022-07-13 11:32:26,298 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 496) no Hoare annotation was computed. [2022-07-13 11:32:26,299 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2022-07-13 11:32:26,299 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-07-13 11:32:26,299 INFO L895 garLoopResultBuilder]: At program point L222(lines 116 612) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse12 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse14 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse17 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse21 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse22 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse23 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse27 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse24 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse25 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse26 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse26) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27 .cse24 .cse25 .cse26))) [2022-07-13 11:32:26,299 INFO L895 garLoopResultBuilder]: At program point L189(lines 185 589) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse19 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse16 .cse17 .cse18 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse18 .cse19) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse18 .cse19))) [2022-07-13 11:32:26,299 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 600) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse20 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse21 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse22 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse18 .cse19 .cse21 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse22) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse21 .cse22))) [2022-07-13 11:32:26,299 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point L554(lines 554 558) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 523) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point L554-2(lines 554 558) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point L521-2(lines 219 576) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 587) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 598) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 609) no Hoare annotation was computed. [2022-07-13 11:32:26,300 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 495) no Hoare annotation was computed. [2022-07-13 11:32:26,301 INFO L899 garLoopResultBuilder]: For program point L489-2(lines 219 576) no Hoare annotation was computed. [2022-07-13 11:32:26,301 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-07-13 11:32:26,301 INFO L902 garLoopResultBuilder]: At program point L655(lines 646 657) the Hoare annotation is: true [2022-07-13 11:32:26,301 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 11:32:26,301 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 627) no Hoare annotation was computed. [2022-07-13 11:32:26,301 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-07-13 11:32:26,301 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-07-13 11:32:26,301 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 586) no Hoare annotation was computed. [2022-07-13 11:32:26,301 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 597) no Hoare annotation was computed. [2022-07-13 11:32:26,301 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-07-13 11:32:26,302 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 608) no Hoare annotation was computed. [2022-07-13 11:32:26,302 INFO L899 garLoopResultBuilder]: For program point L492(lines 492 494) no Hoare annotation was computed. [2022-07-13 11:32:26,302 INFO L895 garLoopResultBuilder]: At program point L195(lines 191 587) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse17 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse19 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse21 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 .cse10 .cse11 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse15 .cse16 .cse19 .cse20 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2022-07-13 11:32:26,302 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 598) the Hoare annotation is: (let ((.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse20 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse18 .cse19 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse4 .cse5 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse18 .cse19 .cse20))) [2022-07-13 11:32:26,302 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-07-13 11:32:26,302 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-07-13 11:32:26,302 INFO L895 garLoopResultBuilder]: At program point L493(lines 83 644) the Hoare annotation is: false [2022-07-13 11:32:26,303 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2022-07-13 11:32:26,303 INFO L895 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse3 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse12 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse21 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse20 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse18 .cse19 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse4 .cse5 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse18 .cse19 .cse20))) [2022-07-13 11:32:26,303 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 585) no Hoare annotation was computed. [2022-07-13 11:32:26,303 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 596) no Hoare annotation was computed. [2022-07-13 11:32:26,303 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 607) no Hoare annotation was computed. [2022-07-13 11:32:26,303 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 11:32:26,303 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 642) no Hoare annotation was computed. [2022-07-13 11:32:26,303 INFO L899 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2022-07-13 11:32:26,304 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse1 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse17 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse9 .cse10 .cse11 .cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse13 .cse14 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse17) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse16 .cse17))) [2022-07-13 11:32:26,304 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 608) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8609))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8608))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8641))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse14 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse17 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8592)) (<= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 7) (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 .cse9 (not (= 8577 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse10 .cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse12 .cse13 (not (= 8593 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse17) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-07-13 11:32:26,304 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2022-07-13 11:32:26,304 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-07-13 11:32:26,304 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-07-13 11:32:26,304 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 219 576) no Hoare annotation was computed. [2022-07-13 11:32:26,304 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-07-13 11:32:26,304 INFO L899 garLoopResultBuilder]: For program point L332-2(lines 219 576) no Hoare annotation was computed. [2022-07-13 11:32:26,305 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 584) no Hoare annotation was computed. [2022-07-13 11:32:26,305 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 595) no Hoare annotation was computed. [2022-07-13 11:32:26,305 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 606) no Hoare annotation was computed. [2022-07-13 11:32:26,305 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-07-13 11:32:26,305 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 83 644) no Hoare annotation was computed. [2022-07-13 11:32:26,307 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-13 11:32:26,309 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:32:26,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:32:26 BoogieIcfgContainer [2022-07-13 11:32:26,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:32:26,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:32:26,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:32:26,350 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:32:26,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:32:06" (3/4) ... [2022-07-13 11:32:26,352 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 11:32:26,363 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-13 11:32:26,366 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 11:32:26,366 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 11:32:26,367 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 11:32:26,438 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:32:26,438 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:32:26,441 INFO L158 Benchmark]: Toolchain (without parser) took 20918.28ms. Allocated memory was 130.0MB in the beginning and 490.7MB in the end (delta: 360.7MB). Free memory was 97.9MB in the beginning and 229.9MB in the end (delta: -132.0MB). Peak memory consumption was 229.5MB. Max. memory is 16.1GB. [2022-07-13 11:32:26,444 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:32:26,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.93ms. Allocated memory is still 130.0MB. Free memory was 97.9MB in the beginning and 100.3MB in the end (delta: -2.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2022-07-13 11:32:26,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.64ms. Allocated memory is still 130.0MB. Free memory was 100.3MB in the beginning and 97.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:32:26,446 INFO L158 Benchmark]: Boogie Preprocessor took 52.43ms. Allocated memory is still 130.0MB. Free memory was 97.2MB in the beginning and 95.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:32:26,446 INFO L158 Benchmark]: RCFGBuilder took 521.70ms. Allocated memory is still 130.0MB. Free memory was 95.1MB in the beginning and 102.7MB in the end (delta: -7.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-13 11:32:26,446 INFO L158 Benchmark]: TraceAbstraction took 19920.07ms. Allocated memory was 130.0MB in the beginning and 490.7MB in the end (delta: 360.7MB). Free memory was 102.7MB in the beginning and 238.3MB in the end (delta: -135.6MB). Peak memory consumption was 334.5MB. Max. memory is 16.1GB. [2022-07-13 11:32:26,446 INFO L158 Benchmark]: Witness Printer took 88.70ms. Allocated memory is still 490.7MB. Free memory was 238.3MB in the beginning and 229.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:32:26,447 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.93ms. Allocated memory is still 130.0MB. Free memory was 97.9MB in the beginning and 100.3MB in the end (delta: -2.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.64ms. Allocated memory is still 130.0MB. Free memory was 100.3MB in the beginning and 97.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.43ms. Allocated memory is still 130.0MB. Free memory was 97.2MB in the beginning and 95.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.70ms. Allocated memory is still 130.0MB. Free memory was 95.1MB in the beginning and 102.7MB in the end (delta: -7.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19920.07ms. Allocated memory was 130.0MB in the beginning and 490.7MB in the end (delta: 360.7MB). Free memory was 102.7MB in the beginning and 238.3MB in the end (delta: -135.6MB). Peak memory consumption was 334.5MB. Max. memory is 16.1GB. * Witness Printer took 88.70ms. Allocated memory is still 490.7MB. Free memory was 238.3MB in the beginning and 229.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 642]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 37, TraceHistogramMax: 43, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5970 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5970 mSDsluCounter, 8923 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2369 mSDsCounter, 1400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3543 IncrementalHoareTripleChecker+Invalid, 4943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1400 mSolverCounterUnsat, 6554 mSDtfsCounter, 3543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5060 GetRequests, 5002 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4641occurred in iteration=31, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 2300 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 333 NumberOfFragments, 5683 HoareAnnotationTreeSize, 28 FomulaSimplifications, 12632 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 28 FomulaSimplificationsInter, 74718 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 12600 NumberOfCodeBlocks, 12600 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 14165 ConstructedInterpolants, 0 QuantifiedInterpolants, 19724 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5160 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 45 InterpolantComputations, 35 PerfectInterpolantSequences, 103043/103383 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 646]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(s__state == 8592) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((((((((((!(s__state == 8592) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag <= 2) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state))) || (((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8640) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag <= 2) && !(8497 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8529)) && 8448 <= s__state) && s__state <= 8576) || ((((((((!(8673 == s__state) && !(s__state == 8609)) && !(s__state == 8657)) && blastFlag <= 2) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state))) || s__state <= 3) || ((((((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8609)) && !(s__state == 8657)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state))) || (blastFlag <= 7 && !(0 == s__hit))) || (((blastFlag == 4 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 8448 <= s__state) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state))) || (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || (((blastFlag <= 2 && s__state <= 8448) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && 0 == s__hit) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state))) || (((3 == blastFlag && s__state <= 8448) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((blastFlag <= 7 && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || (((((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state))) || (((((((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || ((((((((((((((((((((((((((!(s__state == 8592) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state))) || ((((((((((((((((((((((((((!(s__state == 8592) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8448 == s__state) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || (((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(8593 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(8560 == s__state)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(s__state == 8512)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit))) || (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(s__state == 8640)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8640)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8640)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(s__state == 8592) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) || ((((((((((((((((((((((!(s__state == 8592) && 3 == blastFlag) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8528)) && !(s__state == 8529)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state))) || (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag <= 2) && !(8497 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8529)) && 8448 <= s__state) && s__state <= 8576) || ((((((((!(8673 == s__state) && !(s__state == 8609)) && !(s__state == 8657)) && blastFlag <= 2) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state))) || s__state <= 3) || ((((((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8609)) && !(s__state == 8657)) && !(8577 == s__state)) && !(12292 == s__state)) && !(s__state == 8641)) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state))) || (blastFlag <= 7 && !(0 == s__hit))) || (((blastFlag == 4 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 8448 <= s__state) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 7) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8577 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8593 == s__state)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) || (((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8608)) && blastFlag <= 2) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((((((((((((((!(s__state == 8592) && !(8673 == s__state)) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8608)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8640)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(8513 == s__state)) && !(s__state == 8641)) && !(s__state == 8480)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && !(s__state == 8512)) && !(8560 == s__state)) RESULT: Ultimate proved your program to be correct! [2022-07-13 11:32:26,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE