./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_1.cil-2.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 01b0b8134efbdf074cddaa1833662276f2c77ab674782f72d5e58899909f6aa6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:45:55,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:45:55,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:45:55,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:45:55,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:45:55,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:45:55,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:45:55,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:45:55,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:45:55,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:45:55,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:45:55,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:45:55,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:45:55,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:45:55,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:45:55,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:45:55,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:45:55,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:45:55,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:45:55,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:45:55,605 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:45:55,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:45:55,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:45:55,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:45:55,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:45:55,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:45:55,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:45:55,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:45:55,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:45:55,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:45:55,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:45:55,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:45:55,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:45:55,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:45:55,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:45:55,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:45:55,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:45:55,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:45:55,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:45:55,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:45:55,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:45:55,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:45:55,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:45:55,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:45:55,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:45:55,646 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:45:55,646 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:45:55,647 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:45:55,647 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:45:55,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:45:55,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:45:55,648 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:45:55,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:45:55,649 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:45:55,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:45:55,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:45:55,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:45:55,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:45:55,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:45:55,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:45:55,650 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:45:55,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:45:55,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:45:55,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:45:55,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:45:55,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:45:55,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:45:55,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:45:55,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:45:55,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:45:55,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:45:55,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:45:55,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:45:55,653 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:45:55,653 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:45:55,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:45:55,653 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 -> 01b0b8134efbdf074cddaa1833662276f2c77ab674782f72d5e58899909f6aa6 [2022-07-11 23:45:55,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:45:55,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:45:55,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:45:55,869 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:45:55,869 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:45:55,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c [2022-07-11 23:45:55,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2fef597a/24bf1f90c7f14882b53119e2c36c4fbc/FLAG6a730b279 [2022-07-11 23:45:56,242 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:45:56,251 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c [2022-07-11 23:45:56,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2fef597a/24bf1f90c7f14882b53119e2c36c4fbc/FLAG6a730b279 [2022-07-11 23:45:56,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2fef597a/24bf1f90c7f14882b53119e2c36c4fbc [2022-07-11 23:45:56,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:45:56,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:45:56,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:45:56,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:45:56,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:45:56,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4206fd1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56, skipping insertion in model container [2022-07-11 23:45:56,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:45:56,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:45:56,858 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_1.cil-2.c[43387,43400] [2022-07-11 23:45:56,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:45:56,873 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:45:56,902 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_1.cil-2.c[43387,43400] [2022-07-11 23:45:56,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:45:56,911 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:45:56,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56 WrapperNode [2022-07-11 23:45:56,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:45:56,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:45:56,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:45:56,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:45:56,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,947 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 549 [2022-07-11 23:45:56,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:45:56,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:45:56,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:45:56,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:45:56,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:45:56,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:45:56,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:45:56,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:45:56,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (1/1) ... [2022-07-11 23:45:56,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:45:56,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:56,994 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-11 23:45:56,995 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-11 23:45:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:45:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:45:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:45:57,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:45:57,071 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:45:57,073 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:45:57,083 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:45:57,507 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:45:57,514 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:45:57,515 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:45:57,520 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:45:57,522 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:45:57,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:57 BoogieIcfgContainer [2022-07-11 23:45:57,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:45:57,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:45:57,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:45:57,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:45:57,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:45:56" (1/3) ... [2022-07-11 23:45:57,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cc5ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:45:57, skipping insertion in model container [2022-07-11 23:45:57,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:56" (2/3) ... [2022-07-11 23:45:57,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cc5ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:45:57, skipping insertion in model container [2022-07-11 23:45:57,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:57" (3/3) ... [2022-07-11 23:45:57,530 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2022-07-11 23:45:57,541 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:45:57,542 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:45:57,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:45:57,597 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@68e3c8fb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1fcde3aa [2022-07-11 23:45:57,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:45:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.7112676056338028) internal successors, (243), 143 states have internal predecessors, (243), 0 states have call successors, (0), 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-11 23:45:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:45:57,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:57,617 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, 1, 1] [2022-07-11 23:45:57,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:57,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:57,622 INFO L85 PathProgramCache]: Analyzing trace with hash -947483280, now seen corresponding path program 1 times [2022-07-11 23:45:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:57,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961682425] [2022-07-11 23:45:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:57,860 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-11 23:45:57,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:57,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961682425] [2022-07-11 23:45:57,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961682425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:57,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:57,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:57,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982850293] [2022-07-11 23:45:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:57,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:57,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:57,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:57,896 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.7112676056338028) internal successors, (243), 143 states have internal predecessors, (243), 0 states have call successors, (0), 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 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-11 23:45:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:58,076 INFO L93 Difference]: Finished difference Result 334 states and 571 transitions. [2022-07-11 23:45:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:58,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-07-11 23:45:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:58,086 INFO L225 Difference]: With dead ends: 334 [2022-07-11 23:45:58,087 INFO L226 Difference]: Without dead ends: 178 [2022-07-11 23:45:58,089 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-11 23:45:58,092 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 172 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:58,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 194 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-11 23:45:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2022-07-11 23:45:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.6257309941520468) internal successors, (278), 171 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 278 transitions. [2022-07-11 23:45:58,125 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 278 transitions. Word has length 45 [2022-07-11 23:45:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:58,125 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 278 transitions. [2022-07-11 23:45:58,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-11 23:45:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 278 transitions. [2022-07-11 23:45:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:45:58,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:58,127 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, 1, 1, 1] [2022-07-11 23:45:58,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:45:58,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash 472840014, now seen corresponding path program 1 times [2022-07-11 23:45:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:58,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592404088] [2022-07-11 23:45:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:58,180 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-11 23:45:58,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:58,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592404088] [2022-07-11 23:45:58,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592404088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:58,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:58,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:58,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196460047] [2022-07-11 23:45:58,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:58,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:58,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:58,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:58,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:58,183 INFO L87 Difference]: Start difference. First operand 172 states and 278 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-11 23:45:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:58,295 INFO L93 Difference]: Finished difference Result 385 states and 632 transitions. [2022-07-11 23:45:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:58,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-07-11 23:45:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:58,297 INFO L225 Difference]: With dead ends: 385 [2022-07-11 23:45:58,297 INFO L226 Difference]: Without dead ends: 219 [2022-07-11 23:45:58,298 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-11 23:45:58,299 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 132 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:58,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 147 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-11 23:45:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2022-07-11 23:45:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.6745283018867925) internal successors, (355), 212 states have internal predecessors, (355), 0 states have call successors, (0), 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-11 23:45:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 355 transitions. [2022-07-11 23:45:58,330 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 355 transitions. Word has length 46 [2022-07-11 23:45:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:58,330 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 355 transitions. [2022-07-11 23:45:58,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-11 23:45:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 355 transitions. [2022-07-11 23:45:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-11 23:45:58,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:58,333 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, 1, 1, 1, 1] [2022-07-11 23:45:58,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:45:58,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:58,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1882217598, now seen corresponding path program 1 times [2022-07-11 23:45:58,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:58,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688720355] [2022-07-11 23:45:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:58,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:58,387 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-11 23:45:58,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:58,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688720355] [2022-07-11 23:45:58,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688720355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:58,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:58,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:58,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735995463] [2022-07-11 23:45:58,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:58,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:58,390 INFO L87 Difference]: Start difference. First operand 213 states and 355 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-11 23:45:58,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:58,492 INFO L93 Difference]: Finished difference Result 449 states and 756 transitions. [2022-07-11 23:45:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:58,493 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 74 [2022-07-11 23:45:58,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:58,495 INFO L225 Difference]: With dead ends: 449 [2022-07-11 23:45:58,495 INFO L226 Difference]: Without dead ends: 244 [2022-07-11 23:45:58,499 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-11 23:45:58,504 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 138 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 159 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-11 23:45:58,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 159 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-11 23:45:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-07-11 23:45:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.691358024691358) internal successors, (411), 243 states have internal predecessors, (411), 0 states have call successors, (0), 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-11 23:45:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 411 transitions. [2022-07-11 23:45:58,524 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 411 transitions. Word has length 74 [2022-07-11 23:45:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:58,525 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 411 transitions. [2022-07-11 23:45:58,525 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-11 23:45:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 411 transitions. [2022-07-11 23:45:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-11 23:45:58,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:58,527 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, 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-11 23:45:58,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:45:58,527 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:58,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:58,528 INFO L85 PathProgramCache]: Analyzing trace with hash 273082035, now seen corresponding path program 1 times [2022-07-11 23:45:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:58,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640603952] [2022-07-11 23:45:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:45:58,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:58,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640603952] [2022-07-11 23:45:58,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640603952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:58,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:58,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959453446] [2022-07-11 23:45:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:58,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:58,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:58,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:58,616 INFO L87 Difference]: Start difference. First operand 244 states and 411 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-11 23:45:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:58,739 INFO L93 Difference]: Finished difference Result 526 states and 892 transitions. [2022-07-11 23:45:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:58,739 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 85 [2022-07-11 23:45:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:58,741 INFO L225 Difference]: With dead ends: 526 [2022-07-11 23:45:58,741 INFO L226 Difference]: Without dead ends: 290 [2022-07-11 23:45:58,741 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-11 23:45:58,742 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 147 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-11 23:45:58,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 147 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-11 23:45:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2022-07-11 23:45:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.7052631578947368) internal successors, (486), 285 states have internal predecessors, (486), 0 states have call successors, (0), 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-11 23:45:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 486 transitions. [2022-07-11 23:45:58,756 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 486 transitions. Word has length 85 [2022-07-11 23:45:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:58,756 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 486 transitions. [2022-07-11 23:45:58,756 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-11 23:45:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 486 transitions. [2022-07-11 23:45:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-11 23:45:58,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:58,759 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, 1, 1, 1, 1] [2022-07-11 23:45:58,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:45:58,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:58,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash -189215496, now seen corresponding path program 1 times [2022-07-11 23:45:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:58,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000446722] [2022-07-11 23:45:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:58,798 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-11 23:45:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:58,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000446722] [2022-07-11 23:45:58,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000446722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:58,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:58,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328202647] [2022-07-11 23:45:58,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:58,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:58,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:58,801 INFO L87 Difference]: Start difference. First operand 286 states and 486 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-11 23:45:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:58,866 INFO L93 Difference]: Finished difference Result 581 states and 988 transitions. [2022-07-11 23:45:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:58,867 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 86 [2022-07-11 23:45:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:58,868 INFO L225 Difference]: With dead ends: 581 [2022-07-11 23:45:58,868 INFO L226 Difference]: Without dead ends: 303 [2022-07-11 23:45:58,869 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-11 23:45:58,869 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 161 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 141 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-11 23:45:58,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 141 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-11 23:45:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2022-07-11 23:45:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.6933333333333334) internal successors, (508), 300 states have internal predecessors, (508), 0 states have call successors, (0), 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-11 23:45:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 508 transitions. [2022-07-11 23:45:58,887 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 508 transitions. Word has length 86 [2022-07-11 23:45:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:58,889 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 508 transitions. [2022-07-11 23:45:58,889 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-11 23:45:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 508 transitions. [2022-07-11 23:45:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-11 23:45:58,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:58,891 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, 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-11 23:45:58,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:45:58,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1661072911, now seen corresponding path program 1 times [2022-07-11 23:45:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:58,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103717973] [2022-07-11 23:45:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:58,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:45:58,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:58,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103717973] [2022-07-11 23:45:58,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103717973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:58,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:58,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:58,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136975061] [2022-07-11 23:45:58,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:58,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:58,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:58,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:58,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:58,947 INFO L87 Difference]: Start difference. First operand 301 states and 508 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-11 23:45:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,053 INFO L93 Difference]: Finished difference Result 598 states and 1009 transitions. [2022-07-11 23:45:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2022-07-11 23:45:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,056 INFO L225 Difference]: With dead ends: 598 [2022-07-11 23:45:59,056 INFO L226 Difference]: Without dead ends: 303 [2022-07-11 23:45:59,056 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-11 23:45:59,057 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 134 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:59,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 145 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-11 23:45:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2022-07-11 23:45:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6879194630872483) internal successors, (503), 298 states have internal predecessors, (503), 0 states have call successors, (0), 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-11 23:45:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 503 transitions. [2022-07-11 23:45:59,063 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 503 transitions. Word has length 86 [2022-07-11 23:45:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,063 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 503 transitions. [2022-07-11 23:45:59,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-11 23:45:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 503 transitions. [2022-07-11 23:45:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-11 23:45:59,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,064 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, 1, 1, 1, 1] [2022-07-11 23:45:59,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:45:59,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1734029471, now seen corresponding path program 1 times [2022-07-11 23:45:59,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574807073] [2022-07-11 23:45:59,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,089 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-11 23:45:59,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574807073] [2022-07-11 23:45:59,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574807073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:59,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:59,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:59,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114156835] [2022-07-11 23:45:59,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:59,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:59,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,092 INFO L87 Difference]: Start difference. First operand 299 states and 503 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-11 23:45:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,154 INFO L93 Difference]: Finished difference Result 592 states and 996 transitions. [2022-07-11 23:45:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-07-11 23:45:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,156 INFO L225 Difference]: With dead ends: 592 [2022-07-11 23:45:59,156 INFO L226 Difference]: Without dead ends: 301 [2022-07-11 23:45:59,157 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-11 23:45:59,159 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 160 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 141 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-11 23:45:59,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 141 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-11 23:45:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2022-07-11 23:45:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.674496644295302) internal successors, (499), 298 states have internal predecessors, (499), 0 states have call successors, (0), 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-11 23:45:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 499 transitions. [2022-07-11 23:45:59,167 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 499 transitions. Word has length 87 [2022-07-11 23:45:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,167 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 499 transitions. [2022-07-11 23:45:59,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-11 23:45:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 499 transitions. [2022-07-11 23:45:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-11 23:45:59,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,168 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, 1, 1, 1, 1, 1] [2022-07-11 23:45:59,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:45:59,168 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1834464481, now seen corresponding path program 1 times [2022-07-11 23:45:59,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438627942] [2022-07-11 23:45:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,206 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-11 23:45:59,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438627942] [2022-07-11 23:45:59,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438627942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:59,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:59,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:59,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438925991] [2022-07-11 23:45:59,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:59,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:59,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,208 INFO L87 Difference]: Start difference. First operand 299 states and 499 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-11 23:45:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,269 INFO L93 Difference]: Finished difference Result 599 states and 998 transitions. [2022-07-11 23:45:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-11 23:45:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,271 INFO L225 Difference]: With dead ends: 599 [2022-07-11 23:45:59,271 INFO L226 Difference]: Without dead ends: 308 [2022-07-11 23:45:59,271 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-11 23:45:59,272 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 165 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 152 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.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:59,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 152 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-11 23:45:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-07-11 23:45:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.6449511400651466) internal successors, (505), 307 states have internal predecessors, (505), 0 states have call successors, (0), 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-11 23:45:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 505 transitions. [2022-07-11 23:45:59,278 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 505 transitions. Word has length 100 [2022-07-11 23:45:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,278 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 505 transitions. [2022-07-11 23:45:59,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-11 23:45:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 505 transitions. [2022-07-11 23:45:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-11 23:45:59,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,279 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, 1, 1, 1, 1] [2022-07-11 23:45:59,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:45:59,279 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1347542277, now seen corresponding path program 1 times [2022-07-11 23:45:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914781521] [2022-07-11 23:45:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,297 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-11 23:45:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914781521] [2022-07-11 23:45:59,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914781521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:59,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:59,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:59,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286526848] [2022-07-11 23:45:59,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:59,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,299 INFO L87 Difference]: Start difference. First operand 308 states and 505 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-11 23:45:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,383 INFO L93 Difference]: Finished difference Result 639 states and 1051 transitions. [2022-07-11 23:45:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,384 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 100 [2022-07-11 23:45:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,385 INFO L225 Difference]: With dead ends: 639 [2022-07-11 23:45:59,385 INFO L226 Difference]: Without dead ends: 339 [2022-07-11 23:45:59,385 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-11 23:45:59,386 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 144 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 144 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-11 23:45:59,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 144 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-11 23:45:59,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2022-07-11 23:45:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.6428571428571428) internal successors, (552), 336 states have internal predecessors, (552), 0 states have call successors, (0), 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-11 23:45:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 552 transitions. [2022-07-11 23:45:59,392 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 552 transitions. Word has length 100 [2022-07-11 23:45:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,392 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 552 transitions. [2022-07-11 23:45:59,393 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-11 23:45:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 552 transitions. [2022-07-11 23:45:59,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-11 23:45:59,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,393 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, 1, 1, 1, 1] [2022-07-11 23:45:59,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:45:59,394 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,394 INFO L85 PathProgramCache]: Analyzing trace with hash -218926398, now seen corresponding path program 1 times [2022-07-11 23:45:59,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494250965] [2022-07-11 23:45:59,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,420 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-11 23:45:59,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494250965] [2022-07-11 23:45:59,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494250965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:59,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:59,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985428107] [2022-07-11 23:45:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:59,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,422 INFO L87 Difference]: Start difference. First operand 337 states and 552 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-11 23:45:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,499 INFO L93 Difference]: Finished difference Result 668 states and 1094 transitions. [2022-07-11 23:45:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,499 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 101 [2022-07-11 23:45:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,501 INFO L225 Difference]: With dead ends: 668 [2022-07-11 23:45:59,501 INFO L226 Difference]: Without dead ends: 339 [2022-07-11 23:45:59,501 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-11 23:45:59,501 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 143 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 144 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-11 23:45:59,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 144 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-11 23:45:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2022-07-11 23:45:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.630952380952381) internal successors, (548), 336 states have internal predecessors, (548), 0 states have call successors, (0), 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-11 23:45:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 548 transitions. [2022-07-11 23:45:59,508 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 548 transitions. Word has length 101 [2022-07-11 23:45:59,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,508 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 548 transitions. [2022-07-11 23:45:59,508 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-11 23:45:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 548 transitions. [2022-07-11 23:45:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-11 23:45:59,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,509 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, 1, 1, 1, 1] [2022-07-11 23:45:59,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:45:59,510 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash 253103787, now seen corresponding path program 1 times [2022-07-11 23:45:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388932417] [2022-07-11 23:45:59,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,530 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-11 23:45:59,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388932417] [2022-07-11 23:45:59,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388932417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:59,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:59,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:59,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144941452] [2022-07-11 23:45:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:59,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:59,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,532 INFO L87 Difference]: Start difference. First operand 337 states and 548 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-11 23:45:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,606 INFO L93 Difference]: Finished difference Result 701 states and 1144 transitions. [2022-07-11 23:45:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,606 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 102 [2022-07-11 23:45:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,608 INFO L225 Difference]: With dead ends: 701 [2022-07-11 23:45:59,608 INFO L226 Difference]: Without dead ends: 372 [2022-07-11 23:45:59,609 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-11 23:45:59,609 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 146 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 152 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-11 23:45:59,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 152 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-11 23:45:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2022-07-11 23:45:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.6253443526170799) internal successors, (590), 363 states have internal predecessors, (590), 0 states have call successors, (0), 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-11 23:45:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 590 transitions. [2022-07-11 23:45:59,617 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 590 transitions. Word has length 102 [2022-07-11 23:45:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,618 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 590 transitions. [2022-07-11 23:45:59,618 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-11 23:45:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 590 transitions. [2022-07-11 23:45:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-11 23:45:59,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,619 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, 1, 1, 1, 1] [2022-07-11 23:45:59,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:45:59,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1231802386, now seen corresponding path program 1 times [2022-07-11 23:45:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195423364] [2022-07-11 23:45:59,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,640 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-11 23:45:59,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195423364] [2022-07-11 23:45:59,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195423364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:59,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:59,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:59,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981165978] [2022-07-11 23:45:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:59,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,643 INFO L87 Difference]: Start difference. First operand 364 states and 590 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-11 23:45:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,724 INFO L93 Difference]: Finished difference Result 728 states and 1181 transitions. [2022-07-11 23:45:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,725 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 103 [2022-07-11 23:45:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,726 INFO L225 Difference]: With dead ends: 728 [2022-07-11 23:45:59,726 INFO L226 Difference]: Without dead ends: 372 [2022-07-11 23:45:59,727 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-11 23:45:59,727 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 145 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 152 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-11 23:45:59,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 152 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-11 23:45:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2022-07-11 23:45:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.6115702479338843) internal successors, (585), 363 states have internal predecessors, (585), 0 states have call successors, (0), 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-11 23:45:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 585 transitions. [2022-07-11 23:45:59,735 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 585 transitions. Word has length 103 [2022-07-11 23:45:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,735 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 585 transitions. [2022-07-11 23:45:59,736 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-11 23:45:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 585 transitions. [2022-07-11 23:45:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:45:59,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-11 23:45:59,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:45:59,737 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1055170647, now seen corresponding path program 1 times [2022-07-11 23:45:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441621324] [2022-07-11 23:45:59,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-11 23:45:59,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441621324] [2022-07-11 23:45:59,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441621324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:59,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:59,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:59,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214670935] [2022-07-11 23:45:59,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:59,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,770 INFO L87 Difference]: Start difference. First operand 364 states and 585 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-11 23:45:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,841 INFO L93 Difference]: Finished difference Result 745 states and 1199 transitions. [2022-07-11 23:45:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,842 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 106 [2022-07-11 23:45:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,843 INFO L225 Difference]: With dead ends: 745 [2022-07-11 23:45:59,843 INFO L226 Difference]: Without dead ends: 389 [2022-07-11 23:45:59,844 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-11 23:45:59,845 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 152 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 147 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-11 23:45:59,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 147 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-07-11 23:45:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2022-07-11 23:45:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 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-11 23:45:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2022-07-11 23:45:59,853 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 106 [2022-07-11 23:45:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,853 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2022-07-11 23:45:59,853 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-11 23:45:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2022-07-11 23:45:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-11 23:45:59,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,854 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-11 23:45:59,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:45:59,854 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2125345872, now seen corresponding path program 1 times [2022-07-11 23:45:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735452144] [2022-07-11 23:45:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-11 23:45:59,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735452144] [2022-07-11 23:45:59,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735452144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:59,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:59,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:59,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804938555] [2022-07-11 23:45:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:59,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:59,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,880 INFO L87 Difference]: Start difference. First operand 385 states and 614 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-11 23:45:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,955 INFO L93 Difference]: Finished difference Result 766 states and 1222 transitions. [2022-07-11 23:45:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,956 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 107 [2022-07-11 23:45:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,957 INFO L225 Difference]: With dead ends: 766 [2022-07-11 23:45:59,957 INFO L226 Difference]: Without dead ends: 389 [2022-07-11 23:45:59,958 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-11 23:45:59,958 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 151 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 147 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-11 23:45:59,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 147 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-07-11 23:45:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2022-07-11 23:45:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5833333333333333) internal successors, (608), 384 states have internal predecessors, (608), 0 states have call successors, (0), 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-11 23:45:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 608 transitions. [2022-07-11 23:45:59,970 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 608 transitions. Word has length 107 [2022-07-11 23:45:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,970 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 608 transitions. [2022-07-11 23:45:59,970 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-11 23:45:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 608 transitions. [2022-07-11 23:45:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-11 23:45:59,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:59,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:45:59,972 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1817702491, now seen corresponding path program 1 times [2022-07-11 23:45:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443158414] [2022-07-11 23:45:59,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:45:59,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443158414] [2022-07-11 23:45:59,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443158414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:59,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:59,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:59,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461795230] [2022-07-11 23:45:59,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:59,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,999 INFO L87 Difference]: Start difference. First operand 385 states and 608 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:00,029 INFO L93 Difference]: Finished difference Result 1093 states and 1730 transitions. [2022-07-11 23:46:00,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:00,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-11 23:46:00,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:00,032 INFO L225 Difference]: With dead ends: 1093 [2022-07-11 23:46:00,032 INFO L226 Difference]: Without dead ends: 716 [2022-07-11 23:46:00,033 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-11 23:46:00,034 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 137 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:00,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 548 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-07-11 23:46:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2022-07-11 23:46:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.5776223776223777) internal successors, (1128), 715 states have internal predecessors, (1128), 0 states have call successors, (0), 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-11 23:46:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1128 transitions. [2022-07-11 23:46:00,051 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1128 transitions. Word has length 122 [2022-07-11 23:46:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:00,051 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 1128 transitions. [2022-07-11 23:46:00,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1128 transitions. [2022-07-11 23:46:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-11 23:46:00,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:00,053 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:00,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:46:00,053 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash 231685351, now seen corresponding path program 1 times [2022-07-11 23:46:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:00,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958710380] [2022-07-11 23:46:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:46:00,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:00,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958710380] [2022-07-11 23:46:00,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958710380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:00,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:00,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913092074] [2022-07-11 23:46:00,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:00,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:00,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:00,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:00,092 INFO L87 Difference]: Start difference. First operand 716 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:00,129 INFO L93 Difference]: Finished difference Result 1795 states and 2834 transitions. [2022-07-11 23:46:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-11 23:46:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:00,132 INFO L225 Difference]: With dead ends: 1795 [2022-07-11 23:46:00,132 INFO L226 Difference]: Without dead ends: 1087 [2022-07-11 23:46:00,133 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-11 23:46:00,133 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 134 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:00,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 547 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2022-07-11 23:46:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2022-07-11 23:46:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.576427255985267) internal successors, (1712), 1086 states have internal predecessors, (1712), 0 states have call successors, (0), 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-11 23:46:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1712 transitions. [2022-07-11 23:46:00,156 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1712 transitions. Word has length 122 [2022-07-11 23:46:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:00,156 INFO L495 AbstractCegarLoop]: Abstraction has 1087 states and 1712 transitions. [2022-07-11 23:46:00,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1712 transitions. [2022-07-11 23:46:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-11 23:46:00,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:00,158 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:00,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:46:00,158 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash 58780327, now seen corresponding path program 1 times [2022-07-11 23:46:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:00,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267206653] [2022-07-11 23:46:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-11 23:46:00,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267206653] [2022-07-11 23:46:00,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267206653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:00,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:00,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361024681] [2022-07-11 23:46:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:00,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:00,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:00,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:00,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:00,178 INFO L87 Difference]: Start difference. First operand 1087 states and 1712 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-11 23:46:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:00,216 INFO L93 Difference]: Finished difference Result 2537 states and 4002 transitions. [2022-07-11 23:46:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:00,216 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 122 [2022-07-11 23:46:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:00,220 INFO L225 Difference]: With dead ends: 2537 [2022-07-11 23:46:00,220 INFO L226 Difference]: Without dead ends: 1458 [2022-07-11 23:46:00,221 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-11 23:46:00,222 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 157 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:00,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 551 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2022-07-11 23:46:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2022-07-11 23:46:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1457 states have (on average 1.575840768702814) internal successors, (2296), 1457 states have internal predecessors, (2296), 0 states have call successors, (0), 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-11 23:46:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2296 transitions. [2022-07-11 23:46:00,252 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2296 transitions. Word has length 122 [2022-07-11 23:46:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:00,253 INFO L495 AbstractCegarLoop]: Abstraction has 1458 states and 2296 transitions. [2022-07-11 23:46:00,253 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-11 23:46:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2296 transitions. [2022-07-11 23:46:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-11 23:46:00,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:00,255 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:00,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:46:00,255 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1448074341, now seen corresponding path program 1 times [2022-07-11 23:46:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:00,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164058941] [2022-07-11 23:46:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:00,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-11 23:46:00,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:00,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164058941] [2022-07-11 23:46:00,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164058941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:00,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:00,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:00,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984502818] [2022-07-11 23:46:00,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:00,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:00,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:00,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:00,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:00,273 INFO L87 Difference]: Start difference. First operand 1458 states and 2296 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-11 23:46:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:00,338 INFO L93 Difference]: Finished difference Result 3261 states and 5139 transitions. [2022-07-11 23:46:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:00,338 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 122 [2022-07-11 23:46:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:00,343 INFO L225 Difference]: With dead ends: 3261 [2022-07-11 23:46:00,343 INFO L226 Difference]: Without dead ends: 1811 [2022-07-11 23:46:00,345 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-11 23:46:00,346 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 172 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:00,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 392 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-07-11 23:46:00,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2022-07-11 23:46:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.5740331491712707) internal successors, (2849), 1810 states have internal predecessors, (2849), 0 states have call successors, (0), 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-11 23:46:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2849 transitions. [2022-07-11 23:46:00,382 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2849 transitions. Word has length 122 [2022-07-11 23:46:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:00,382 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 2849 transitions. [2022-07-11 23:46:00,382 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-11 23:46:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2849 transitions. [2022-07-11 23:46:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-11 23:46:00,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:00,386 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:00,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:46:00,386 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash -969992260, now seen corresponding path program 1 times [2022-07-11 23:46:00,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:00,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934156313] [2022-07-11 23:46:00,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-11 23:46:00,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:00,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934156313] [2022-07-11 23:46:00,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934156313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:00,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:00,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621676157] [2022-07-11 23:46:00,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:00,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:00,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:00,417 INFO L87 Difference]: Start difference. First operand 1811 states and 2849 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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-11 23:46:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:00,540 INFO L93 Difference]: Finished difference Result 3664 states and 5746 transitions. [2022-07-11 23:46:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:00,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 200 [2022-07-11 23:46:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:00,546 INFO L225 Difference]: With dead ends: 3664 [2022-07-11 23:46:00,546 INFO L226 Difference]: Without dead ends: 1861 [2022-07-11 23:46:00,548 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-11 23:46:00,549 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 32 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:00,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 301 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2022-07-11 23:46:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1811. [2022-07-11 23:46:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.5342541436464088) internal successors, (2777), 1810 states have internal predecessors, (2777), 0 states have call successors, (0), 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-11 23:46:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2777 transitions. [2022-07-11 23:46:00,618 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2777 transitions. Word has length 200 [2022-07-11 23:46:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:00,618 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 2777 transitions. [2022-07-11 23:46:00,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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-11 23:46:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2777 transitions. [2022-07-11 23:46:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-11 23:46:00,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:00,622 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:00,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:46:00,622 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1149451039, now seen corresponding path program 1 times [2022-07-11 23:46:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:00,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007067731] [2022-07-11 23:46:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-11 23:46:00,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:00,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007067731] [2022-07-11 23:46:00,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007067731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:00,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:00,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114335704] [2022-07-11 23:46:00,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:00,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:00,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:00,657 INFO L87 Difference]: Start difference. First operand 1811 states and 2777 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-11 23:46:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:00,788 INFO L93 Difference]: Finished difference Result 3686 states and 5625 transitions. [2022-07-11 23:46:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 215 [2022-07-11 23:46:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:00,794 INFO L225 Difference]: With dead ends: 3686 [2022-07-11 23:46:00,794 INFO L226 Difference]: Without dead ends: 1883 [2022-07-11 23:46:00,796 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-11 23:46:00,796 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 155 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:00,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 168 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2022-07-11 23:46:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1811. [2022-07-11 23:46:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.4922651933701658) internal successors, (2701), 1810 states have internal predecessors, (2701), 0 states have call successors, (0), 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-11 23:46:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2701 transitions. [2022-07-11 23:46:00,842 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2701 transitions. Word has length 215 [2022-07-11 23:46:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:00,842 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 2701 transitions. [2022-07-11 23:46:00,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-11 23:46:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2701 transitions. [2022-07-11 23:46:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-07-11 23:46:00,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:00,846 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-11 23:46:00,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:46:00,846 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:00,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 978401702, now seen corresponding path program 1 times [2022-07-11 23:46:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:00,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966402691] [2022-07-11 23:46:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-11 23:46:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:00,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966402691] [2022-07-11 23:46:00,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966402691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:00,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:00,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553917609] [2022-07-11 23:46:00,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:00,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:00,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:00,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:00,896 INFO L87 Difference]: Start difference. First operand 1811 states and 2701 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-11 23:46:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:01,017 INFO L93 Difference]: Finished difference Result 3614 states and 5390 transitions. [2022-07-11 23:46:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:01,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 243 [2022-07-11 23:46:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:01,023 INFO L225 Difference]: With dead ends: 3614 [2022-07-11 23:46:01,023 INFO L226 Difference]: Without dead ends: 1811 [2022-07-11 23:46:01,025 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-11 23:46:01,026 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 15 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:01,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 306 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-07-11 23:46:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2022-07-11 23:46:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.4618784530386741) internal successors, (2646), 1810 states have internal predecessors, (2646), 0 states have call successors, (0), 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-11 23:46:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2646 transitions. [2022-07-11 23:46:01,075 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2646 transitions. Word has length 243 [2022-07-11 23:46:01,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:01,075 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 2646 transitions. [2022-07-11 23:46:01,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-11 23:46:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2646 transitions. [2022-07-11 23:46:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-07-11 23:46:01,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:01,080 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-11 23:46:01,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:46:01,080 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:01,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash -904430186, now seen corresponding path program 1 times [2022-07-11 23:46:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:01,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41484166] [2022-07-11 23:46:01,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:01,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-11 23:46:01,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:01,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41484166] [2022-07-11 23:46:01,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41484166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:01,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:01,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374208256] [2022-07-11 23:46:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:01,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:01,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:01,119 INFO L87 Difference]: Start difference. First operand 1811 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-11 23:46:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:01,201 INFO L93 Difference]: Finished difference Result 5321 states and 7772 transitions. [2022-07-11 23:46:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:01,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 272 [2022-07-11 23:46:01,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:01,213 INFO L225 Difference]: With dead ends: 5321 [2022-07-11 23:46:01,213 INFO L226 Difference]: Without dead ends: 3518 [2022-07-11 23:46:01,216 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-11 23:46:01,216 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 124 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 549 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-11 23:46:01,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 549 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2022-07-11 23:46:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3516. [2022-07-11 23:46:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 3515 states have (on average 1.4577524893314366) internal successors, (5124), 3515 states have internal predecessors, (5124), 0 states have call successors, (0), 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-11 23:46:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 5124 transitions. [2022-07-11 23:46:01,339 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 5124 transitions. Word has length 272 [2022-07-11 23:46:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:01,340 INFO L495 AbstractCegarLoop]: Abstraction has 3516 states and 5124 transitions. [2022-07-11 23:46:01,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-11 23:46:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 5124 transitions. [2022-07-11 23:46:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-11 23:46:01,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:01,347 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:01,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:46:01,347 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1940271524, now seen corresponding path program 1 times [2022-07-11 23:46:01,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:01,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94682978] [2022-07-11 23:46:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:01,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 525 proven. 66 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-07-11 23:46:01,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:01,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94682978] [2022-07-11 23:46:01,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94682978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:01,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587431571] [2022-07-11 23:46:01,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:01,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:01,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:01,391 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-11 23:46:01,394 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-11 23:46:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:01,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:46:01,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-07-11 23:46:01,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:46:01,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587431571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:01,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:46:01,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:46:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964862673] [2022-07-11 23:46:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:01,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:01,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:01,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:01,666 INFO L87 Difference]: Start difference. First operand 3516 states and 5124 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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-11 23:46:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:01,756 INFO L93 Difference]: Finished difference Result 4264 states and 6218 transitions. [2022-07-11 23:46:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:01,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 309 [2022-07-11 23:46:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:01,768 INFO L225 Difference]: With dead ends: 4264 [2022-07-11 23:46:01,768 INFO L226 Difference]: Without dead ends: 4262 [2022-07-11 23:46:01,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 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-11 23:46:01,770 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 132 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:01,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 364 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:01,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2022-07-11 23:46:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4262. [2022-07-11 23:46:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4262 states, 4261 states have (on average 1.458577798638817) internal successors, (6215), 4261 states have internal predecessors, (6215), 0 states have call successors, (0), 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-11 23:46:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 6215 transitions. [2022-07-11 23:46:01,869 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 6215 transitions. Word has length 309 [2022-07-11 23:46:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:01,870 INFO L495 AbstractCegarLoop]: Abstraction has 4262 states and 6215 transitions. [2022-07-11 23:46:01,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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-11 23:46:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 6215 transitions. [2022-07-11 23:46:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-07-11 23:46:01,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:01,878 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, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:01,913 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-11 23:46:02,091 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,SelfDestructingSolverStorable22 [2022-07-11 23:46:02,091 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash 809426729, now seen corresponding path program 1 times [2022-07-11 23:46:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:02,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669611320] [2022-07-11 23:46:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:02,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 848 proven. 66 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2022-07-11 23:46:02,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:02,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669611320] [2022-07-11 23:46:02,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669611320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:02,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121687615] [2022-07-11 23:46:02,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:02,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:02,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:02,176 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-11 23:46:02,177 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-11 23:46:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:02,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:46:02,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 859 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2022-07-11 23:46:02,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:46:02,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121687615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:02,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:46:02,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:46:02,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372754735] [2022-07-11 23:46:02,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:02,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:02,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:02,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:02,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:02,317 INFO L87 Difference]: Start difference. First operand 4262 states and 6215 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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-11 23:46:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:02,489 INFO L93 Difference]: Finished difference Result 8984 states and 13150 transitions. [2022-07-11 23:46:02,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:02,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 380 [2022-07-11 23:46:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:02,513 INFO L225 Difference]: With dead ends: 8984 [2022-07-11 23:46:02,513 INFO L226 Difference]: Without dead ends: 2860 [2022-07-11 23:46:02,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 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-11 23:46:02,520 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 30 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:02,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 302 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-07-11 23:46:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-07-11 23:46:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2859 states have (on average 1.4379153550192374) internal successors, (4111), 2859 states have internal predecessors, (4111), 0 states have call successors, (0), 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-11 23:46:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4111 transitions. [2022-07-11 23:46:02,634 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 4111 transitions. Word has length 380 [2022-07-11 23:46:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:02,634 INFO L495 AbstractCegarLoop]: Abstraction has 2860 states and 4111 transitions. [2022-07-11 23:46:02,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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-11 23:46:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 4111 transitions. [2022-07-11 23:46:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2022-07-11 23:46:02,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:02,641 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 5, 5, 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, 1] [2022-07-11 23:46:02,661 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-11 23:46:02,851 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,SelfDestructingSolverStorable23 [2022-07-11 23:46:02,851 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash -806194589, now seen corresponding path program 1 times [2022-07-11 23:46:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:02,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24184657] [2022-07-11 23:46:02,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 999 trivial. 0 not checked. [2022-07-11 23:46:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:02,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24184657] [2022-07-11 23:46:02,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24184657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:02,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:02,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652235231] [2022-07-11 23:46:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:02,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:02,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:02,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:02,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:02,897 INFO L87 Difference]: Start difference. First operand 2860 states and 4111 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-11 23:46:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:03,020 INFO L93 Difference]: Finished difference Result 5859 states and 8420 transitions. [2022-07-11 23:46:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:03,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 381 [2022-07-11 23:46:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:03,026 INFO L225 Difference]: With dead ends: 5859 [2022-07-11 23:46:03,026 INFO L226 Difference]: Without dead ends: 3007 [2022-07-11 23:46:03,030 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-11 23:46:03,030 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:03,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 311 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2022-07-11 23:46:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2975. [2022-07-11 23:46:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 1.429388029589778) internal successors, (4251), 2974 states have internal predecessors, (4251), 0 states have call successors, (0), 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-11 23:46:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4251 transitions. [2022-07-11 23:46:03,103 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4251 transitions. Word has length 381 [2022-07-11 23:46:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:03,103 INFO L495 AbstractCegarLoop]: Abstraction has 2975 states and 4251 transitions. [2022-07-11 23:46:03,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-11 23:46:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4251 transitions. [2022-07-11 23:46:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2022-07-11 23:46:03,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:03,110 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1] [2022-07-11 23:46:03,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:46:03,110 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash 588994465, now seen corresponding path program 1 times [2022-07-11 23:46:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:03,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720027414] [2022-07-11 23:46:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2022-07-11 23:46:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:03,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720027414] [2022-07-11 23:46:03,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720027414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:03,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:03,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:03,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379912369] [2022-07-11 23:46:03,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:03,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:03,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:03,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:03,181 INFO L87 Difference]: Start difference. First operand 2975 states and 4251 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-11 23:46:03,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:03,314 INFO L93 Difference]: Finished difference Result 6246 states and 8962 transitions. [2022-07-11 23:46:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:03,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 402 [2022-07-11 23:46:03,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:03,321 INFO L225 Difference]: With dead ends: 6246 [2022-07-11 23:46:03,321 INFO L226 Difference]: Without dead ends: 3279 [2022-07-11 23:46:03,324 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-11 23:46:03,324 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 29 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:03,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 311 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-07-11 23:46:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3175. [2022-07-11 23:46:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3174 states have (on average 1.4149338374291116) internal successors, (4491), 3174 states have internal predecessors, (4491), 0 states have call successors, (0), 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-11 23:46:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4491 transitions. [2022-07-11 23:46:03,395 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4491 transitions. Word has length 402 [2022-07-11 23:46:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:03,396 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 4491 transitions. [2022-07-11 23:46:03,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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-11 23:46:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4491 transitions. [2022-07-11 23:46:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2022-07-11 23:46:03,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:03,404 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:03,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:46:03,404 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash 434686614, now seen corresponding path program 1 times [2022-07-11 23:46:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:03,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492536815] [2022-07-11 23:46:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 761 proven. 0 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2022-07-11 23:46:03,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:03,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492536815] [2022-07-11 23:46:03,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492536815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:03,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:03,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42465407] [2022-07-11 23:46:03,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:03,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:03,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:03,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:03,446 INFO L87 Difference]: Start difference. First operand 3175 states and 4491 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-11 23:46:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:03,571 INFO L93 Difference]: Finished difference Result 6406 states and 9074 transitions. [2022-07-11 23:46:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 428 [2022-07-11 23:46:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:03,575 INFO L225 Difference]: With dead ends: 6406 [2022-07-11 23:46:03,575 INFO L226 Difference]: Without dead ends: 3239 [2022-07-11 23:46:03,578 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-11 23:46:03,578 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 19 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:03,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 310 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-07-11 23:46:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3175. [2022-07-11 23:46:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3174 states have (on average 1.3897290485192186) internal successors, (4411), 3174 states have internal predecessors, (4411), 0 states have call successors, (0), 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-11 23:46:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4411 transitions. [2022-07-11 23:46:03,637 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4411 transitions. Word has length 428 [2022-07-11 23:46:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:03,638 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 4411 transitions. [2022-07-11 23:46:03,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-11 23:46:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4411 transitions. [2022-07-11 23:46:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2022-07-11 23:46:03,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:03,649 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 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-11 23:46:03,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:46:03,649 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash -785344079, now seen corresponding path program 1 times [2022-07-11 23:46:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:03,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501257452] [2022-07-11 23:46:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-07-11 23:46:03,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:03,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501257452] [2022-07-11 23:46:03,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501257452] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:03,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948824164] [2022-07-11 23:46:03,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:03,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:03,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:03,704 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-11 23:46:03,705 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-11 23:46:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:03,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:03,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2022-07-11 23:46:04,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:46:04,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948824164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:04,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:46:04,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:46:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541819493] [2022-07-11 23:46:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:04,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:04,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:04,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:04,110 INFO L87 Difference]: Start difference. First operand 3175 states and 4411 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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-11 23:46:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:04,181 INFO L93 Difference]: Finished difference Result 3863 states and 5353 transitions. [2022-07-11 23:46:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:04,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 447 [2022-07-11 23:46:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:04,187 INFO L225 Difference]: With dead ends: 3863 [2022-07-11 23:46:04,187 INFO L226 Difference]: Without dead ends: 3081 [2022-07-11 23:46:04,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 447 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-11 23:46:04,188 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 101 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:04,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 532 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2022-07-11 23:46:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2395. [2022-07-11 23:46:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2394 states have (on average 1.3893065998329157) internal successors, (3326), 2394 states have internal predecessors, (3326), 0 states have call successors, (0), 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-11 23:46:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3326 transitions. [2022-07-11 23:46:04,237 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3326 transitions. Word has length 447 [2022-07-11 23:46:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:04,237 INFO L495 AbstractCegarLoop]: Abstraction has 2395 states and 3326 transitions. [2022-07-11 23:46:04,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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-11 23:46:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3326 transitions. [2022-07-11 23:46:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2022-07-11 23:46:04,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:04,244 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:04,270 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-11 23:46:04,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:04,455 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:04,456 INFO L85 PathProgramCache]: Analyzing trace with hash -708443281, now seen corresponding path program 1 times [2022-07-11 23:46:04,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:04,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737391260] [2022-07-11 23:46:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:04,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-07-11 23:46:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:04,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737391260] [2022-07-11 23:46:04,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737391260] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:04,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579427164] [2022-07-11 23:46:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:04,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:04,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:04,508 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-11 23:46:04,509 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-11 23:46:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:04,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:04,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-07-11 23:46:04,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-07-11 23:46:04,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579427164] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:04,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:46:04,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:46:04,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244164157] [2022-07-11 23:46:04,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:04,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:46:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:04,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:46:04,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:46:04,766 INFO L87 Difference]: Start difference. First operand 2395 states and 3326 transitions. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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-11 23:46:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:05,136 INFO L93 Difference]: Finished difference Result 5876 states and 8163 transitions. [2022-07-11 23:46:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:46:05,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 447 [2022-07-11 23:46:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:05,142 INFO L225 Difference]: With dead ends: 5876 [2022-07-11 23:46:05,142 INFO L226 Difference]: Without dead ends: 3360 [2022-07-11 23:46:05,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 894 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-11 23:46:05,146 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 341 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:05,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 550 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:46:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-07-11 23:46:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2356. [2022-07-11 23:46:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.367728237791932) internal successors, (3221), 2355 states have internal predecessors, (3221), 0 states have call successors, (0), 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-11 23:46:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3221 transitions. [2022-07-11 23:46:05,215 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3221 transitions. Word has length 447 [2022-07-11 23:46:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:05,215 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 3221 transitions. [2022-07-11 23:46:05,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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-11 23:46:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3221 transitions. [2022-07-11 23:46:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2022-07-11 23:46:05,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:05,222 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:05,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-11 23:46:05,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-11 23:46:05,440 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1730115607, now seen corresponding path program 1 times [2022-07-11 23:46:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:05,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261401644] [2022-07-11 23:46:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 1530 proven. 0 refuted. 0 times theorem prover too weak. 2575 trivial. 0 not checked. [2022-07-11 23:46:05,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:05,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261401644] [2022-07-11 23:46:05,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261401644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:05,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:05,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081975507] [2022-07-11 23:46:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:05,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:05,517 INFO L87 Difference]: Start difference. First operand 2356 states and 3221 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 23:46:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:05,625 INFO L93 Difference]: Finished difference Result 4716 states and 6442 transitions. [2022-07-11 23:46:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:05,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 622 [2022-07-11 23:46:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:05,629 INFO L225 Difference]: With dead ends: 4716 [2022-07-11 23:46:05,629 INFO L226 Difference]: Without dead ends: 2368 [2022-07-11 23:46:05,631 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-11 23:46:05,631 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:05,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 298 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-07-11 23:46:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2356. [2022-07-11 23:46:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.3422505307855626) internal successors, (3161), 2355 states have internal predecessors, (3161), 0 states have call successors, (0), 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-11 23:46:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3161 transitions. [2022-07-11 23:46:05,686 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3161 transitions. Word has length 622 [2022-07-11 23:46:05,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:05,686 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 3161 transitions. [2022-07-11 23:46:05,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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-11 23:46:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3161 transitions. [2022-07-11 23:46:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2022-07-11 23:46:05,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:05,692 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 12, 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, 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] [2022-07-11 23:46:05,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:46:05,693 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash 264105968, now seen corresponding path program 1 times [2022-07-11 23:46:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:05,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451499994] [2022-07-11 23:46:05,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:05,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4562 backedges. 2170 proven. 0 refuted. 0 times theorem prover too weak. 2392 trivial. 0 not checked. [2022-07-11 23:46:05,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:05,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451499994] [2022-07-11 23:46:05,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451499994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:05,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:05,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:05,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62759476] [2022-07-11 23:46:05,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:05,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:05,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:05,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:05,773 INFO L87 Difference]: Start difference. First operand 2356 states and 3161 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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-11 23:46:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:05,896 INFO L93 Difference]: Finished difference Result 4920 states and 6628 transitions. [2022-07-11 23:46:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 656 [2022-07-11 23:46:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:05,900 INFO L225 Difference]: With dead ends: 4920 [2022-07-11 23:46:05,900 INFO L226 Difference]: Without dead ends: 2572 [2022-07-11 23:46:05,903 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-11 23:46:05,903 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:05,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2022-07-11 23:46:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2560. [2022-07-11 23:46:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2559 states have (on average 1.3266901133255178) internal successors, (3395), 2559 states have internal predecessors, (3395), 0 states have call successors, (0), 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-11 23:46:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3395 transitions. [2022-07-11 23:46:05,963 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3395 transitions. Word has length 656 [2022-07-11 23:46:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:05,963 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3395 transitions. [2022-07-11 23:46:05,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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-11 23:46:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3395 transitions. [2022-07-11 23:46:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2022-07-11 23:46:05,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:05,971 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 21, 21, 20, 20, 19, 19, 18, 18, 18, 18, 15, 12, 12, 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, 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] [2022-07-11 23:46:05,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:46:05,972 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:05,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash -951624686, now seen corresponding path program 1 times [2022-07-11 23:46:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:05,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93561372] [2022-07-11 23:46:05,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:05,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2953 proven. 0 refuted. 0 times theorem prover too weak. 3223 trivial. 0 not checked. [2022-07-11 23:46:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:06,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93561372] [2022-07-11 23:46:06,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93561372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:06,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:06,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411984327] [2022-07-11 23:46:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:06,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:06,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:06,061 INFO L87 Difference]: Start difference. First operand 2560 states and 3395 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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-11 23:46:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:06,190 INFO L93 Difference]: Finished difference Result 5340 states and 7120 transitions. [2022-07-11 23:46:06,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:06,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 749 [2022-07-11 23:46:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:06,194 INFO L225 Difference]: With dead ends: 5340 [2022-07-11 23:46:06,194 INFO L226 Difference]: Without dead ends: 2788 [2022-07-11 23:46:06,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-11 23:46:06,198 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:06,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2022-07-11 23:46:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2776. [2022-07-11 23:46:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2776 states, 2775 states have (on average 1.312072072072072) internal successors, (3641), 2775 states have internal predecessors, (3641), 0 states have call successors, (0), 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-11 23:46:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3641 transitions. [2022-07-11 23:46:06,275 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3641 transitions. Word has length 749 [2022-07-11 23:46:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:06,275 INFO L495 AbstractCegarLoop]: Abstraction has 2776 states and 3641 transitions. [2022-07-11 23:46:06,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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-11 23:46:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3641 transitions. [2022-07-11 23:46:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2022-07-11 23:46:06,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:06,283 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 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, 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] [2022-07-11 23:46:06,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:46:06,284 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1071625077, now seen corresponding path program 1 times [2022-07-11 23:46:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:06,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632976759] [2022-07-11 23:46:06,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-07-11 23:46:06,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:06,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632976759] [2022-07-11 23:46:06,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632976759] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:06,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735521618] [2022-07-11 23:46:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:06,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:06,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:06,391 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-11 23:46:06,393 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-11 23:46:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:06,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:06,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-07-11 23:46:06,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-07-11 23:46:06,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735521618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:06,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:46:06,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-11 23:46:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770286150] [2022-07-11 23:46:06,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:06,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:46:06,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:06,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:46:06,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:46:06,710 INFO L87 Difference]: Start difference. First operand 2776 states and 3641 transitions. Second operand has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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-11 23:46:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:07,019 INFO L93 Difference]: Finished difference Result 5149 states and 6786 transitions. [2022-07-11 23:46:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:46:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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 848 [2022-07-11 23:46:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:07,021 INFO L225 Difference]: With dead ends: 5149 [2022-07-11 23:46:07,021 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:46:07,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1704 GetRequests, 1695 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-11 23:46:07,025 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 225 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:07,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 788 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:46:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:46:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:46:07,026 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-11 23:46:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:46:07,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 848 [2022-07-11 23:46:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:07,026 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:46:07,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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-11 23:46:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:46:07,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:46:07,029 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:46:07,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:07,244 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,SelfDestructingSolverStorable32 [2022-07-11 23:46:07,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:46:18,205 INFO L899 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2022-07-11 23:46:18,205 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 611) no Hoare annotation was computed. [2022-07-11 23:46:18,205 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2022-07-11 23:46:18,206 INFO L895 garLoopResultBuilder]: At program point L201(lines 197 567) the Hoare annotation is: (let ((.cse9 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)))) [2022-07-11 23:46:18,206 INFO L895 garLoopResultBuilder]: At program point L168(lines 164 578) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.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| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse16) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-11 23:46:18,206 INFO L895 garLoopResultBuilder]: At program point L135(lines 134 588) the Hoare annotation is: (and (not (= 8448 |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)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |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| 8656)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-11 23:46:18,206 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-07-11 23:46:18,206 INFO L895 garLoopResultBuilder]: At program point L631(lines 629 632) the Hoare annotation is: false [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L598(lines 598 603) no Hoare annotation was computed. [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L598-2(lines 597 611) no Hoare annotation was computed. [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 270) no Hoare annotation was computed. [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 306) no Hoare annotation was computed. [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L302-2(lines 302 306) no Hoare annotation was computed. [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 565) no Hoare annotation was computed. [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 576) no Hoare annotation was computed. [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 587) no Hoare annotation was computed. [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 602) no Hoare annotation was computed. [2022-07-11 23:46:18,207 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 237 244) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L503(lines 503 506) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 536 540) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L437(lines 437 445) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L437-2(lines 437 445) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 564) no Hoare annotation was computed. [2022-07-11 23:46:18,208 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 575) no Hoare annotation was computed. [2022-07-11 23:46:18,209 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 586) no Hoare annotation was computed. [2022-07-11 23:46:18,209 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 378) no Hoare annotation was computed. [2022-07-11 23:46:18,209 INFO L895 garLoopResultBuilder]: At program point L207(lines 203 565) 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| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.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 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse9 .cse10))) [2022-07-11 23:46:18,209 INFO L895 garLoopResultBuilder]: At program point L174(lines 170 576) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.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| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-11 23:46:18,209 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2022-07-11 23:46:18,209 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-07-11 23:46:18,209 INFO L895 garLoopResultBuilder]: At program point L407(lines 398 416) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.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| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse16) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-11 23:46:18,209 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 563) no Hoare annotation was computed. [2022-07-11 23:46:18,210 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 574) no Hoare annotation was computed. [2022-07-11 23:46:18,210 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 585) no Hoare annotation was computed. [2022-07-11 23:46:18,210 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 614) the Hoare annotation is: (let ((.cse12 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse11 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse12)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse9 .cse8) (and .cse4 .cse10) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11 .cse8) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse12) (and .cse11 .cse10) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse13 .cse10) (and .cse14 .cse9 .cse15)))) [2022-07-11 23:46:18,210 INFO L899 garLoopResultBuilder]: For program point L342(lines 342 377) no Hoare annotation was computed. [2022-07-11 23:46:18,210 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 342 377) no Hoare annotation was computed. [2022-07-11 23:46:18,210 INFO L895 garLoopResultBuilder]: At program point L177(lines 176 574) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse6 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse1 .cse4 .cse2) (and .cse5 .cse1 .cse2) (and .cse6 .cse1 .cse2) (and .cse6 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1) (and .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse3))) [2022-07-11 23:46:18,210 INFO L895 garLoopResultBuilder]: At program point L144(lines 137 587) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (not (= 8448 |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))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 558) no Hoare annotation was computed. [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 374) no Hoare annotation was computed. [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L410(lines 410 412) no Hoare annotation was computed. [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 562) no Hoare annotation was computed. [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 573) no Hoare annotation was computed. [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 584) no Hoare annotation was computed. [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 595) no Hoare annotation was computed. [2022-07-11 23:46:18,211 INFO L902 garLoopResultBuilder]: At program point L642(lines 633 644) the Hoare annotation is: true [2022-07-11 23:46:18,211 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-07-11 23:46:18,212 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 249) no Hoare annotation was computed. [2022-07-11 23:46:18,212 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 563) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))))) [2022-07-11 23:46:18,212 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 595) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse3))) [2022-07-11 23:46:18,212 INFO L899 garLoopResultBuilder]: For program point L313(lines 313 320) no Hoare annotation was computed. [2022-07-11 23:46:18,212 INFO L899 garLoopResultBuilder]: For program point L313-2(lines 313 320) no Hoare annotation was computed. [2022-07-11 23:46:18,212 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 561) no Hoare annotation was computed. [2022-07-11 23:46:18,212 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 572) no Hoare annotation was computed. [2022-07-11 23:46:18,212 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 583) no Hoare annotation was computed. [2022-07-11 23:46:18,212 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 594) no Hoare annotation was computed. [2022-07-11 23:46:18,213 INFO L899 garLoopResultBuilder]: For program point L546(lines 546 552) no Hoare annotation was computed. [2022-07-11 23:46:18,213 INFO L899 garLoopResultBuilder]: For program point L546-1(lines 546 552) no Hoare annotation was computed. [2022-07-11 23:46:18,213 INFO L899 garLoopResultBuilder]: For program point L348(lines 348 372) no Hoare annotation was computed. [2022-07-11 23:46:18,213 INFO L895 garLoopResultBuilder]: At program point L216(lines 215 561) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-11 23:46:18,213 INFO L895 garLoopResultBuilder]: At program point L183(lines 179 573) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |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| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-11 23:46:18,213 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 584) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse17 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |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 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |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| 8656))) (.cse12 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse11 .cse13) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14))) [2022-07-11 23:46:18,213 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 285) no Hoare annotation was computed. [2022-07-11 23:46:18,213 INFO L899 garLoopResultBuilder]: For program point L283-2(lines 219 558) no Hoare annotation was computed. [2022-07-11 23:46:18,213 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:46:18,214 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 319) no Hoare annotation was computed. [2022-07-11 23:46:18,214 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 262) no Hoare annotation was computed. [2022-07-11 23:46:18,214 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 561) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-11 23:46:18,214 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 571) no Hoare annotation was computed. [2022-07-11 23:46:18,214 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 582) no Hoare annotation was computed. [2022-07-11 23:46:18,214 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 593) no Hoare annotation was computed. [2022-07-11 23:46:18,214 INFO L902 garLoopResultBuilder]: At program point L615(lines 109 616) the Hoare annotation is: true [2022-07-11 23:46:18,214 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 551) no Hoare annotation was computed. [2022-07-11 23:46:18,214 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 520) no Hoare annotation was computed. [2022-07-11 23:46:18,214 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L352-2(lines 352 356) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 256) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L386(lines 386 418) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 570) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 581) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 592) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L486-2(lines 219 558) no Hoare annotation was computed. [2022-07-11 23:46:18,215 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 393) no Hoare annotation was computed. [2022-07-11 23:46:18,216 INFO L895 garLoopResultBuilder]: At program point L222(lines 116 594) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse12 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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| 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| 8657))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse17 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse15 (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) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse15) (and .cse18 .cse1 .cse19 .cse8 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse1 .cse7 .cse8 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15) (and .cse18 .cse1 .cse8 .cse16 .cse17) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse17 .cse15))) [2022-07-11 23:46:18,216 INFO L895 garLoopResultBuilder]: At program point L189(lines 185 571) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |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| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-11 23:46:18,216 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 582) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (not (= 8448 |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))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-11 23:46:18,216 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-07-11 23:46:18,216 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:46:18,216 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2022-07-11 23:46:18,216 INFO L899 garLoopResultBuilder]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2022-07-11 23:46:18,216 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 569) no Hoare annotation was computed. [2022-07-11 23:46:18,217 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 580) no Hoare annotation was computed. [2022-07-11 23:46:18,217 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 591) no Hoare annotation was computed. [2022-07-11 23:46:18,217 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-07-11 23:46:18,217 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:46:18,217 INFO L902 garLoopResultBuilder]: At program point L623(lines 23 627) the Hoare annotation is: true [2022-07-11 23:46:18,217 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-07-11 23:46:18,217 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-07-11 23:46:18,217 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 568) no Hoare annotation was computed. [2022-07-11 23:46:18,217 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 579) no Hoare annotation was computed. [2022-07-11 23:46:18,217 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-07-11 23:46:18,218 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 590) no Hoare annotation was computed. [2022-07-11 23:46:18,218 INFO L899 garLoopResultBuilder]: For program point L525(lines 525 531) no Hoare annotation was computed. [2022-07-11 23:46:18,218 INFO L899 garLoopResultBuilder]: For program point L492(lines 492 496) no Hoare annotation was computed. [2022-07-11 23:46:18,218 INFO L899 garLoopResultBuilder]: For program point L492-2(lines 492 496) no Hoare annotation was computed. [2022-07-11 23:46:18,218 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 368) no Hoare annotation was computed. [2022-07-11 23:46:18,218 INFO L895 garLoopResultBuilder]: At program point L195(lines 191 569) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |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| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-11 23:46:18,218 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 580) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (not (= 8448 |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))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-11 23:46:18,218 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-07-11 23:46:18,219 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-07-11 23:46:18,219 INFO L895 garLoopResultBuilder]: At program point L559(lines 110 614) the Hoare annotation is: (let ((.cse12 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse11 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse12)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse9 .cse8) (and .cse4 .cse10) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11 .cse8) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse12) (and .cse11 .cse10) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse13 .cse10) (and .cse14 .cse9 .cse15)))) [2022-07-11 23:46:18,219 INFO L895 garLoopResultBuilder]: At program point L361(lines 336 379) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (not (= 8448 |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))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-11 23:46:18,219 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 430) no Hoare annotation was computed. [2022-07-11 23:46:18,219 INFO L895 garLoopResultBuilder]: At program point L395(lines 386 418) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.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| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse16) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-11 23:46:18,219 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 298) no Hoare annotation was computed. [2022-07-11 23:46:18,219 INFO L899 garLoopResultBuilder]: For program point L296-2(lines 219 558) no Hoare annotation was computed. [2022-07-11 23:46:18,220 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 567) no Hoare annotation was computed. [2022-07-11 23:46:18,220 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 578) no Hoare annotation was computed. [2022-07-11 23:46:18,220 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 589) no Hoare annotation was computed. [2022-07-11 23:46:18,220 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:46:18,220 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-07-11 23:46:18,220 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 530) no Hoare annotation was computed. [2022-07-11 23:46:18,220 INFO L899 garLoopResultBuilder]: For program point L528-2(lines 219 558) no Hoare annotation was computed. [2022-07-11 23:46:18,220 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 365) no Hoare annotation was computed. [2022-07-11 23:46:18,220 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-07-11 23:46:18,221 INFO L899 garLoopResultBuilder]: For program point L330-2(lines 219 558) no Hoare annotation was computed. [2022-07-11 23:46:18,221 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 590) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |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))) (.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse12) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13))) [2022-07-11 23:46:18,221 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-07-11 23:46:18,221 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 612) no Hoare annotation was computed. [2022-07-11 23:46:18,221 INFO L899 garLoopResultBuilder]: For program point L398(lines 398 416) no Hoare annotation was computed. [2022-07-11 23:46:18,221 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 566) no Hoare annotation was computed. [2022-07-11 23:46:18,221 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 577) no Hoare annotation was computed. [2022-07-11 23:46:18,221 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 588) no Hoare annotation was computed. [2022-07-11 23:46:18,221 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-07-11 23:46:18,221 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 84 626) no Hoare annotation was computed. [2022-07-11 23:46:18,224 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] [2022-07-11 23:46:18,225 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:46:18,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:46:18 BoogieIcfgContainer [2022-07-11 23:46:18,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:46:18,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:46:18,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:46:18,258 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:46:18,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:57" (3/4) ... [2022-07-11 23:46:18,260 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:46:18,272 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-11 23:46:18,273 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:46:18,273 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:46:18,274 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:46:18,339 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:46:18,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:46:18,340 INFO L158 Benchmark]: Toolchain (without parser) took 21695.71ms. Allocated memory was 111.1MB in the beginning and 459.3MB in the end (delta: 348.1MB). Free memory was 75.8MB in the beginning and 299.0MB in the end (delta: -223.2MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. [2022-07-11 23:46:18,340 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 111.1MB. Free memory was 83.6MB in the beginning and 83.6MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:46:18,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.44ms. Allocated memory is still 111.1MB. Free memory was 75.5MB in the beginning and 81.6MB in the end (delta: -6.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-11 23:46:18,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.84ms. Allocated memory is still 111.1MB. Free memory was 81.6MB in the beginning and 78.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:46:18,346 INFO L158 Benchmark]: Boogie Preprocessor took 20.49ms. Allocated memory is still 111.1MB. Free memory was 78.7MB in the beginning and 76.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:18,346 INFO L158 Benchmark]: RCFGBuilder took 555.36ms. Allocated memory is still 111.1MB. Free memory was 76.6MB in the beginning and 46.0MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-11 23:46:18,347 INFO L158 Benchmark]: TraceAbstraction took 20731.87ms. Allocated memory was 111.1MB in the beginning and 459.3MB in the end (delta: 348.1MB). Free memory was 45.8MB in the beginning and 307.4MB in the end (delta: -261.5MB). Peak memory consumption was 247.7MB. Max. memory is 16.1GB. [2022-07-11 23:46:18,348 INFO L158 Benchmark]: Witness Printer took 82.24ms. Allocated memory is still 459.3MB. Free memory was 307.4MB in the beginning and 299.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:46:18,349 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.09ms. Allocated memory is still 111.1MB. Free memory was 83.6MB in the beginning and 83.6MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.44ms. Allocated memory is still 111.1MB. Free memory was 75.5MB in the beginning and 81.6MB in the end (delta: -6.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.84ms. Allocated memory is still 111.1MB. Free memory was 81.6MB in the beginning and 78.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.49ms. Allocated memory is still 111.1MB. Free memory was 78.7MB in the beginning and 76.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 555.36ms. Allocated memory is still 111.1MB. Free memory was 76.6MB in the beginning and 46.0MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20731.87ms. Allocated memory was 111.1MB in the beginning and 459.3MB in the end (delta: 348.1MB). Free memory was 45.8MB in the beginning and 307.4MB in the end (delta: -261.5MB). Peak memory consumption was 247.7MB. Max. memory is 16.1GB. * Witness Printer took 82.24ms. Allocated memory is still 459.3MB. Free memory was 307.4MB in the beginning and 299.0MB 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: 630]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 33, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3928 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3928 mSDsluCounter, 9832 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3344 mSDsCounter, 941 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3412 IncrementalHoareTripleChecker+Invalid, 4353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 941 mSolverCounterUnsat, 6488 mSDtfsCounter, 3412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3835 GetRequests, 3783 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4262occurred in iteration=23, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 2102 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 443 NumberOfFragments, 6546 HoareAnnotationTreeSize, 28 FomulaSimplifications, 27679 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 28 FomulaSimplificationsInter, 66868 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 10746 NumberOfCodeBlocks, 10746 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 12001 ConstructedInterpolants, 0 QuantifiedInterpolants, 16552 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3870 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 61230/61544 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: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) && s__state <= 8672 - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || s__state <= 3) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || s__state <= 3) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || (((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((8672 <= s__state && !(8673 == s__state)) && 3 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((blastFlag == 1 && 8448 == s__state) && !(0 == s__hit)) || ((8448 == s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((8448 == s__state && blastFlag == 0) && !(0 == s__hit))) || ((2 == blastFlag && 8448 == s__state) && !(0 == s__hit))) || ((3 == blastFlag && 8448 == s__state) && !(0 == s__hit))) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || ((blastFlag == 1 && 8448 == s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 8448 == s__state) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || ((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state))) || (((8672 <= s__state && 2 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && !(8656 <= s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) RESULT: Ultimate proved your program to be correct! [2022-07-11 23:46:18,393 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