./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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_3.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f4304a957668929d4c4ca97a168406535fe955ba86c164574a4a7768919c53b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:55:50,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:55:50,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:55:50,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:55:50,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:55:50,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:55:50,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:55:50,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:55:50,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:55:50,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:55:50,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:55:50,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:55:50,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:55:50,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:55:50,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:55:50,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:55:50,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:55:50,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:55:50,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:55:50,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:55:50,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:55:50,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:55:50,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:55:50,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:55:50,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:55:50,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:55:50,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:55:50,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:55:50,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:55:50,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:55:50,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:55:50,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:55:50,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:55:50,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:55:50,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:55:50,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:55:50,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:55:50,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:55:50,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:55:50,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:55:50,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:55:50,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 21:55:50,484 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:55:50,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:55:50,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:55:50,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:55:50,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:55:50,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:55:50,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:55:50,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:55:50,487 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:55:50,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:55:50,488 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:55:50,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 21:55:50,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:55:50,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:55:50,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:55:50,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:55:50,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:55:50,489 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:55:50,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:55:50,489 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:55:50,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:55:50,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:55:50,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:55:50,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:55:50,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:55:50,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:55:50,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:55:50,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:55:50,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 21:55:50,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 21:55:50,491 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:55:50,491 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:55:50,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:55:50,491 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 -> 5f4304a957668929d4c4ca97a168406535fe955ba86c164574a4a7768919c53b [2021-12-27 21:55:50,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:55:50,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:55:50,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:55:50,774 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:55:50,774 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:55:50,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c [2021-12-27 21:55:50,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbf17763/292f7f4f95fd4e889a73fb9ed78d44ae/FLAG657aaafc9 [2021-12-27 21:55:51,148 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:55:51,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c [2021-12-27 21:55:51,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbf17763/292f7f4f95fd4e889a73fb9ed78d44ae/FLAG657aaafc9 [2021-12-27 21:55:51,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbf17763/292f7f4f95fd4e889a73fb9ed78d44ae [2021-12-27 21:55:51,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:55:51,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:55:51,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:55:51,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:55:51,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:55:51,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5336c6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51, skipping insertion in model container [2021-12-27 21:55:51,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:55:51,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:55:51,735 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_3.cil.c[42783,42796] [2021-12-27 21:55:51,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:55:51,759 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:55:51,856 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_3.cil.c[42783,42796] [2021-12-27 21:55:51,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:55:51,874 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:55:51,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51 WrapperNode [2021-12-27 21:55:51,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:55:51,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:55:51,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:55:51,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:55:51,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,921 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 546 [2021-12-27 21:55:51,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:55:51,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:55:51,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:55:51,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:55:51,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:55:51,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:55:51,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:55:51,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:55:51,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (1/1) ... [2021-12-27 21:55:51,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:55:51,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:55:52,000 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) [2021-12-27 21:55:52,006 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 [2021-12-27 21:55:52,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:55:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 21:55:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:55:52,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:55:52,087 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:55:52,088 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:55:52,098 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:55:52,560 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-12-27 21:55:52,560 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-12-27 21:55:52,561 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:55:52,565 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:55:52,571 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-27 21:55:52,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:55:52 BoogieIcfgContainer [2021-12-27 21:55:52,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:55:52,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:55:52,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:55:52,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:55:52,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:55:51" (1/3) ... [2021-12-27 21:55:52,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd96c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:55:52, skipping insertion in model container [2021-12-27 21:55:52,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:55:51" (2/3) ... [2021-12-27 21:55:52,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd96c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:55:52, skipping insertion in model container [2021-12-27 21:55:52,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:55:52" (3/3) ... [2021-12-27 21:55:52,578 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2021-12-27 21:55:52,582 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:55:52,582 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:55:52,612 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:55:52,617 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:55:52,617 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:55:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-27 21:55:52,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:52,636 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:52,636 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:52,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1632006987, now seen corresponding path program 1 times [2021-12-27 21:55:52,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:52,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000932874] [2021-12-27 21:55:52,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:52,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:52,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:52,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000932874] [2021-12-27 21:55:52,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000932874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:52,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:52,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:52,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970299259] [2021-12-27 21:55:52,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:52,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:52,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:52,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:52,834 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:53,038 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-12-27 21:55:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-12-27 21:55:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:53,047 INFO L225 Difference]: With dead ends: 328 [2021-12-27 21:55:53,047 INFO L226 Difference]: Without dead ends: 175 [2021-12-27 21:55:53,050 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:53,052 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 190 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.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:53,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 190 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:55:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-27 21:55:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-12-27 21:55:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-12-27 21:55:53,084 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-12-27 21:55:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:53,084 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-12-27 21:55:53,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-12-27 21:55:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-27 21:55:53,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:53,086 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:53,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 21:55:53,087 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:53,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:53,087 INFO L85 PathProgramCache]: Analyzing trace with hash -954575443, now seen corresponding path program 1 times [2021-12-27 21:55:53,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:53,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365562042] [2021-12-27 21:55:53,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:53,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:53,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:53,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365562042] [2021-12-27 21:55:53,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365562042] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:53,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:53,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:53,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541856663] [2021-12-27 21:55:53,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:53,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:53,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:53,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:53,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:53,162 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. 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) [2021-12-27 21:55:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:53,313 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-12-27 21:55:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:53,313 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 [2021-12-27 21:55:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:53,318 INFO L225 Difference]: With dead ends: 380 [2021-12-27 21:55:53,319 INFO L226 Difference]: Without dead ends: 216 [2021-12-27 21:55:53,325 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:53,327 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 142 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 [2021-12-27 21:55:53,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 142 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-27 21:55:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-12-27 21:55:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-12-27 21:55:53,347 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-12-27 21:55:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:53,348 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-12-27 21:55:53,348 INFO L471 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) [2021-12-27 21:55:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-12-27 21:55:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-27 21:55:53,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:53,356 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:53,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 21:55:53,360 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:53,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:53,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1216100442, now seen corresponding path program 1 times [2021-12-27 21:55:53,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:53,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061085716] [2021-12-27 21:55:53,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:53,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:53,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:53,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061085716] [2021-12-27 21:55:53,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061085716] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:53,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:53,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:53,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201530013] [2021-12-27 21:55:53,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:53,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:53,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:53,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:53,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:53,461 INFO L87 Difference]: Start difference. First operand 211 states and 352 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) [2021-12-27 21:55:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:53,565 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-12-27 21:55:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:53,566 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 72 [2021-12-27 21:55:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:53,567 INFO L225 Difference]: With dead ends: 445 [2021-12-27 21:55:53,567 INFO L226 Difference]: Without dead ends: 242 [2021-12-27 21:55:53,568 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:53,568 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 155 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 [2021-12-27 21:55:53,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 155 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-27 21:55:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-12-27 21:55:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-12-27 21:55:53,579 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-12-27 21:55:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:53,580 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-12-27 21:55:53,580 INFO L471 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) [2021-12-27 21:55:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-12-27 21:55:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-27 21:55:53,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:53,582 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:53,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-27 21:55:53,582 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:53,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2076235292, now seen corresponding path program 1 times [2021-12-27 21:55:53,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:53,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963530268] [2021-12-27 21:55:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:53,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-27 21:55:53,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:53,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963530268] [2021-12-27 21:55:53,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963530268] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:53,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:53,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:53,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313207338] [2021-12-27 21:55:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:53,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:53,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:53,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:53,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:53,668 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:53,769 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-12-27 21:55:53,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:53,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 84 [2021-12-27 21:55:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:53,783 INFO L225 Difference]: With dead ends: 493 [2021-12-27 21:55:53,783 INFO L226 Difference]: Without dead ends: 259 [2021-12-27 21:55:53,784 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:53,785 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 158 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 150 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 [2021-12-27 21:55:53,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 150 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-27 21:55:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-12-27 21:55:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-12-27 21:55:53,793 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-12-27 21:55:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:53,793 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-12-27 21:55:53,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-12-27 21:55:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-27 21:55:53,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:53,794 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:53,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-27 21:55:53,795 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1320798359, now seen corresponding path program 1 times [2021-12-27 21:55:53,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:53,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868677288] [2021-12-27 21:55:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:53,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:53,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:53,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868677288] [2021-12-27 21:55:53,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868677288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:53,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:53,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:53,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323384705] [2021-12-27 21:55:53,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:53,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:53,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:53,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:53,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:53,833 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:53,941 INFO L93 Difference]: Finished difference Result 552 states and 931 transitions. [2021-12-27 21:55:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:53,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-12-27 21:55:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:53,943 INFO L225 Difference]: With dead ends: 552 [2021-12-27 21:55:53,943 INFO L226 Difference]: Without dead ends: 303 [2021-12-27 21:55:53,943 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:53,944 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 133 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 144 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 [2021-12-27 21:55:53,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 144 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-27 21:55:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-12-27 21:55:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 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) [2021-12-27 21:55:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-12-27 21:55:53,952 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-12-27 21:55:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:53,953 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-12-27 21:55:53,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-12-27 21:55:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-27 21:55:53,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:53,954 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:53,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 21:55:53,954 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 858126211, now seen corresponding path program 1 times [2021-12-27 21:55:53,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:53,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044062211] [2021-12-27 21:55:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:53,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-27 21:55:53,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:53,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044062211] [2021-12-27 21:55:53,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044062211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:53,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:53,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:53,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68031150] [2021-12-27 21:55:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:53,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:53,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:53,985 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:54,067 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-12-27 21:55:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:54,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 [2021-12-27 21:55:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:54,069 INFO L225 Difference]: With dead ends: 592 [2021-12-27 21:55:54,069 INFO L226 Difference]: Without dead ends: 301 [2021-12-27 21:55:54,070 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:54,070 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 138 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 [2021-12-27 21:55:54,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 138 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-27 21:55:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-12-27 21:55:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-12-27 21:55:54,077 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-12-27 21:55:54,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:54,077 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-12-27 21:55:54,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-12-27 21:55:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-27 21:55:54,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:54,078 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:54,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-27 21:55:54,079 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:54,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash -274811797, now seen corresponding path program 1 times [2021-12-27 21:55:54,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:54,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409660635] [2021-12-27 21:55:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:54,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:54,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:54,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409660635] [2021-12-27 21:55:54,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409660635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:54,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:54,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:54,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444696936] [2021-12-27 21:55:54,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:54,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:54,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:54,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:54,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:54,111 INFO L87 Difference]: Start difference. First operand 299 states and 501 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) [2021-12-27 21:55:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:54,216 INFO L93 Difference]: Finished difference Result 594 states and 995 transitions. [2021-12-27 21:55:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:54,216 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 [2021-12-27 21:55:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:54,218 INFO L225 Difference]: With dead ends: 594 [2021-12-27 21:55:54,218 INFO L226 Difference]: Without dead ends: 301 [2021-12-27 21:55:54,218 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:54,219 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:54,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 143 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-27 21:55:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2021-12-27 21:55:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-12-27 21:55:54,225 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-12-27 21:55:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:54,226 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-12-27 21:55:54,226 INFO L471 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) [2021-12-27 21:55:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-12-27 21:55:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-27 21:55:54,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:54,227 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:54,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-27 21:55:54,227 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:54,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1018959428, now seen corresponding path program 1 times [2021-12-27 21:55:54,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:54,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930860074] [2021-12-27 21:55:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:54,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-27 21:55:54,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:54,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930860074] [2021-12-27 21:55:54,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930860074] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:54,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:54,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:54,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428373830] [2021-12-27 21:55:54,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:54,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:54,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:54,256 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:54,334 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-12-27 21:55:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:54,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-12-27 21:55:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:54,336 INFO L225 Difference]: With dead ends: 595 [2021-12-27 21:55:54,336 INFO L226 Difference]: Without dead ends: 306 [2021-12-27 21:55:54,336 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:54,337 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 149 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 [2021-12-27 21:55:54,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 149 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-27 21:55:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-12-27 21:55:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-12-27 21:55:54,346 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-12-27 21:55:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:54,347 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-12-27 21:55:54,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-12-27 21:55:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-27 21:55:54,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:54,350 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:54,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-27 21:55:54,350 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:54,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:54,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1695142111, now seen corresponding path program 1 times [2021-12-27 21:55:54,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:54,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048700107] [2021-12-27 21:55:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:54,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-27 21:55:54,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:54,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048700107] [2021-12-27 21:55:54,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048700107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:54,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:54,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:54,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592863013] [2021-12-27 21:55:54,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:54,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:54,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:54,413 INFO L87 Difference]: Start difference. First operand 306 states and 502 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) [2021-12-27 21:55:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:54,503 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-12-27 21:55:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:54,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-12-27 21:55:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:54,506 INFO L225 Difference]: With dead ends: 635 [2021-12-27 21:55:54,506 INFO L226 Difference]: Without dead ends: 337 [2021-12-27 21:55:54,507 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:54,508 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 141 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 [2021-12-27 21:55:54,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 141 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-27 21:55:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-12-27 21:55:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-12-27 21:55:54,516 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-12-27 21:55:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:54,516 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-12-27 21:55:54,517 INFO L471 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) [2021-12-27 21:55:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-12-27 21:55:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-27 21:55:54,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:54,518 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:54,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-27 21:55:54,518 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:54,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -618764698, now seen corresponding path program 1 times [2021-12-27 21:55:54,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:54,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589044014] [2021-12-27 21:55:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:54,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-27 21:55:54,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589044014] [2021-12-27 21:55:54,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589044014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:54,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:54,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:54,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592409267] [2021-12-27 21:55:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:54,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:54,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:54,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:54,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:54,556 INFO L87 Difference]: Start difference. First operand 335 states and 549 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) [2021-12-27 21:55:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:54,649 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-12-27 21:55:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-12-27 21:55:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:54,650 INFO L225 Difference]: With dead ends: 664 [2021-12-27 21:55:54,651 INFO L226 Difference]: Without dead ends: 337 [2021-12-27 21:55:54,651 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:54,652 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 141 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 [2021-12-27 21:55:54,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 141 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-27 21:55:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-12-27 21:55:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-12-27 21:55:54,661 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-12-27 21:55:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:54,662 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-12-27 21:55:54,662 INFO L471 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) [2021-12-27 21:55:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-12-27 21:55:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-27 21:55:54,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:54,663 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:54,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-27 21:55:54,664 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:54,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:54,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1470499215, now seen corresponding path program 1 times [2021-12-27 21:55:54,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:54,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298200520] [2021-12-27 21:55:54,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:54,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-27 21:55:54,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:54,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298200520] [2021-12-27 21:55:54,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298200520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:54,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:54,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:54,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569038933] [2021-12-27 21:55:54,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:54,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:54,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:54,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:54,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:54,714 INFO L87 Difference]: Start difference. First operand 335 states and 545 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) [2021-12-27 21:55:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:54,802 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-12-27 21:55:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:54,802 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 [2021-12-27 21:55:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:54,804 INFO L225 Difference]: With dead ends: 697 [2021-12-27 21:55:54,804 INFO L226 Difference]: Without dead ends: 370 [2021-12-27 21:55:54,805 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:54,806 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 149 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 [2021-12-27 21:55:54,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-27 21:55:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-12-27 21:55:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-12-27 21:55:54,814 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-12-27 21:55:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:54,815 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-12-27 21:55:54,815 INFO L471 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) [2021-12-27 21:55:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-12-27 21:55:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-27 21:55:54,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:54,816 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:54,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-27 21:55:54,817 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:54,817 INFO L85 PathProgramCache]: Analyzing trace with hash 863697078, now seen corresponding path program 1 times [2021-12-27 21:55:54,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:54,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491564949] [2021-12-27 21:55:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:54,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-27 21:55:54,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:54,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491564949] [2021-12-27 21:55:54,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491564949] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:54,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:54,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:54,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517119909] [2021-12-27 21:55:54,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:54,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:54,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:54,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:54,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:54,850 INFO L87 Difference]: Start difference. First operand 362 states and 587 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) [2021-12-27 21:55:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:54,937 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-12-27 21:55:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:54,938 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 [2021-12-27 21:55:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:54,939 INFO L225 Difference]: With dead ends: 724 [2021-12-27 21:55:54,939 INFO L226 Difference]: Without dead ends: 370 [2021-12-27 21:55:54,940 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:54,940 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 149 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 [2021-12-27 21:55:54,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 149 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-27 21:55:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-12-27 21:55:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-12-27 21:55:54,949 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-12-27 21:55:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:54,949 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-12-27 21:55:54,949 INFO L471 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) [2021-12-27 21:55:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-12-27 21:55:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-27 21:55:54,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:54,950 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:54,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-27 21:55:54,951 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash 227220919, now seen corresponding path program 1 times [2021-12-27 21:55:54,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:54,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961464755] [2021-12-27 21:55:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:54,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-27 21:55:54,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:54,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961464755] [2021-12-27 21:55:54,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961464755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:54,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:54,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:54,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091194414] [2021-12-27 21:55:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:54,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:54,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:54,977 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:55,069 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2021-12-27 21:55:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-12-27 21:55:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:55,070 INFO L225 Difference]: With dead ends: 741 [2021-12-27 21:55:55,071 INFO L226 Difference]: Without dead ends: 387 [2021-12-27 21:55:55,071 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:55,072 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 144 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 [2021-12-27 21:55:55,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 144 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-12-27 21:55:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-12-27 21:55:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-12-27 21:55:55,082 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-12-27 21:55:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:55,082 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-12-27 21:55:55,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-12-27 21:55:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-27 21:55:55,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:55,083 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:55,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-27 21:55:55,084 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1469868848, now seen corresponding path program 1 times [2021-12-27 21:55:55,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:55,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733122371] [2021-12-27 21:55:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:55,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-27 21:55:55,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:55,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733122371] [2021-12-27 21:55:55,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733122371] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:55,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:55,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:55,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847846087] [2021-12-27 21:55:55,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:55,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:55,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:55,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:55,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:55,113 INFO L87 Difference]: Start difference. First operand 383 states and 611 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) [2021-12-27 21:55:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:55,192 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2021-12-27 21:55:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:55,192 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 [2021-12-27 21:55:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:55,194 INFO L225 Difference]: With dead ends: 762 [2021-12-27 21:55:55,194 INFO L226 Difference]: Without dead ends: 387 [2021-12-27 21:55:55,194 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:55,195 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 144 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 [2021-12-27 21:55:55,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 144 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-12-27 21:55:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-12-27 21:55:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-12-27 21:55:55,204 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-12-27 21:55:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:55,205 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-12-27 21:55:55,205 INFO L471 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) [2021-12-27 21:55:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-12-27 21:55:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-27 21:55:55,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:55,206 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:55,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-27 21:55:55,207 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:55,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:55,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1361423817, now seen corresponding path program 1 times [2021-12-27 21:55:55,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:55,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728136528] [2021-12-27 21:55:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:55,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-27 21:55:55,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:55,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728136528] [2021-12-27 21:55:55,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728136528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:55,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:55,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:55,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607832213] [2021-12-27 21:55:55,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:55,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:55,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:55,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:55,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:55,235 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:55,267 INFO L93 Difference]: Finished difference Result 1127 states and 1785 transitions. [2021-12-27 21:55:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:55,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-12-27 21:55:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:55,270 INFO L225 Difference]: With dead ends: 1127 [2021-12-27 21:55:55,270 INFO L226 Difference]: Without dead ends: 752 [2021-12-27 21:55:55,271 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:55,272 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 133 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:55,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 539 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:55:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-12-27 21:55:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2021-12-27 21:55:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 1.5805592543275633) internal successors, (1187), 751 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1187 transitions. [2021-12-27 21:55:55,305 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1187 transitions. Word has length 121 [2021-12-27 21:55:55,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:55,305 INFO L470 AbstractCegarLoop]: Abstraction has 752 states and 1187 transitions. [2021-12-27 21:55:55,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1187 transitions. [2021-12-27 21:55:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-27 21:55:55,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:55,307 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:55,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-27 21:55:55,307 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:55,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2036150201, now seen corresponding path program 1 times [2021-12-27 21:55:55,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:55,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499113163] [2021-12-27 21:55:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:55,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-27 21:55:55,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:55,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499113163] [2021-12-27 21:55:55,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499113163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:55,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:55,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:55,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584987865] [2021-12-27 21:55:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:55,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:55,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:55,336 INFO L87 Difference]: Start difference. First operand 752 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:55,368 INFO L93 Difference]: Finished difference Result 1825 states and 2885 transitions. [2021-12-27 21:55:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:55,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 121 [2021-12-27 21:55:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:55,371 INFO L225 Difference]: With dead ends: 1825 [2021-12-27 21:55:55,372 INFO L226 Difference]: Without dead ends: 1081 [2021-12-27 21:55:55,373 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:55,373 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 135 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:55,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 543 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:55:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-12-27 21:55:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2021-12-27 21:55:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1080 states have (on average 1.5787037037037037) internal successors, (1705), 1080 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1705 transitions. [2021-12-27 21:55:55,398 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1705 transitions. Word has length 121 [2021-12-27 21:55:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:55,399 INFO L470 AbstractCegarLoop]: Abstraction has 1081 states and 1705 transitions. [2021-12-27 21:55:55,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1705 transitions. [2021-12-27 21:55:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-27 21:55:55,401 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:55,401 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:55,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-27 21:55:55,401 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash 157019255, now seen corresponding path program 1 times [2021-12-27 21:55:55,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:55,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443593289] [2021-12-27 21:55:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:55,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-27 21:55:55,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:55,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443593289] [2021-12-27 21:55:55,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443593289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:55,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:55,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:55,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452225929] [2021-12-27 21:55:55,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:55,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:55,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:55,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:55,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:55,424 INFO L87 Difference]: Start difference. First operand 1081 states and 1705 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:55,480 INFO L93 Difference]: Finished difference Result 2523 states and 3985 transitions. [2021-12-27 21:55:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-12-27 21:55:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:55,485 INFO L225 Difference]: With dead ends: 2523 [2021-12-27 21:55:55,486 INFO L226 Difference]: Without dead ends: 1450 [2021-12-27 21:55:55,487 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:55,487 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 155 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:55,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 546 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:55:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2021-12-27 21:55:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2021-12-27 21:55:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1449 states have (on average 1.5783298826777088) internal successors, (2287), 1449 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2287 transitions. [2021-12-27 21:55:55,527 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2287 transitions. Word has length 121 [2021-12-27 21:55:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:55,527 INFO L470 AbstractCegarLoop]: Abstraction has 1450 states and 2287 transitions. [2021-12-27 21:55:55,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2287 transitions. [2021-12-27 21:55:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-27 21:55:55,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:55,530 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:55,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-27 21:55:55,531 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1876374791, now seen corresponding path program 1 times [2021-12-27 21:55:55,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:55,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582697187] [2021-12-27 21:55:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:55,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-27 21:55:55,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:55,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582697187] [2021-12-27 21:55:55,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582697187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:55,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:55,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:55,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772588850] [2021-12-27 21:55:55,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:55,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:55,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:55,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:55,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:55,553 INFO L87 Difference]: Start difference. First operand 1450 states and 2287 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) [2021-12-27 21:55:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:55,597 INFO L93 Difference]: Finished difference Result 3243 states and 5118 transitions. [2021-12-27 21:55:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:55,597 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 121 [2021-12-27 21:55:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:55,602 INFO L225 Difference]: With dead ends: 3243 [2021-12-27 21:55:55,603 INFO L226 Difference]: Without dead ends: 1801 [2021-12-27 21:55:55,605 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:55,605 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 170 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:55,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 388 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:55:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2021-12-27 21:55:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2021-12-27 21:55:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.5766666666666667) internal successors, (2838), 1800 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2838 transitions. [2021-12-27 21:55:55,666 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2838 transitions. Word has length 121 [2021-12-27 21:55:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:55,667 INFO L470 AbstractCegarLoop]: Abstraction has 1801 states and 2838 transitions. [2021-12-27 21:55:55,667 INFO L471 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) [2021-12-27 21:55:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2838 transitions. [2021-12-27 21:55:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-12-27 21:55:55,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:55,671 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:55,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-27 21:55:55,671 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:55,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2028887816, now seen corresponding path program 1 times [2021-12-27 21:55:55,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:55,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795221778] [2021-12-27 21:55:55,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:55,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-27 21:55:55,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:55,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795221778] [2021-12-27 21:55:55,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795221778] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:55,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:55,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:55,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723817140] [2021-12-27 21:55:55,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:55,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:55,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:55,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:55,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:55,703 INFO L87 Difference]: Start difference. First operand 1801 states and 2838 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:55,822 INFO L93 Difference]: Finished difference Result 3644 states and 5724 transitions. [2021-12-27 21:55:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:55,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2021-12-27 21:55:55,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:55,828 INFO L225 Difference]: With dead ends: 3644 [2021-12-27 21:55:55,828 INFO L226 Difference]: Without dead ends: 1851 [2021-12-27 21:55:55,830 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:55,831 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 30 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 297 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 [2021-12-27 21:55:55,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 297 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2021-12-27 21:55:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1801. [2021-12-27 21:55:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.5366666666666666) internal successors, (2766), 1800 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2766 transitions. [2021-12-27 21:55:55,872 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2766 transitions. Word has length 199 [2021-12-27 21:55:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:55,872 INFO L470 AbstractCegarLoop]: Abstraction has 1801 states and 2766 transitions. [2021-12-27 21:55:55,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2766 transitions. [2021-12-27 21:55:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-12-27 21:55:55,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:55,876 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:55,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-27 21:55:55,876 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash -965634174, now seen corresponding path program 1 times [2021-12-27 21:55:55,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:55,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227419836] [2021-12-27 21:55:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:55,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-12-27 21:55:55,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:55,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227419836] [2021-12-27 21:55:55,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227419836] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:55,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:55,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:55,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070367132] [2021-12-27 21:55:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:55,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:55,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:55,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:55,922 INFO L87 Difference]: Start difference. First operand 1801 states and 2766 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) [2021-12-27 21:55:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:56,048 INFO L93 Difference]: Finished difference Result 3661 states and 5597 transitions. [2021-12-27 21:55:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:56,048 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 213 [2021-12-27 21:55:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:56,053 INFO L225 Difference]: With dead ends: 3661 [2021-12-27 21:55:56,054 INFO L226 Difference]: Without dead ends: 1868 [2021-12-27 21:55:56,056 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:56,056 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 163 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 [2021-12-27 21:55:56,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2021-12-27 21:55:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1801. [2021-12-27 21:55:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.4944444444444445) internal successors, (2690), 1800 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2690 transitions. [2021-12-27 21:55:56,100 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2690 transitions. Word has length 213 [2021-12-27 21:55:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:56,101 INFO L470 AbstractCegarLoop]: Abstraction has 1801 states and 2690 transitions. [2021-12-27 21:55:56,101 INFO L471 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) [2021-12-27 21:55:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2690 transitions. [2021-12-27 21:55:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-12-27 21:55:56,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:56,105 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:56,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-27 21:55:56,105 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1818923529, now seen corresponding path program 1 times [2021-12-27 21:55:56,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:56,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981450412] [2021-12-27 21:55:56,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:56,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-27 21:55:56,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:56,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981450412] [2021-12-27 21:55:56,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981450412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:56,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:56,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:56,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069024162] [2021-12-27 21:55:56,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:56,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:56,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:56,141 INFO L87 Difference]: Start difference. First operand 1801 states and 2690 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:56,218 INFO L93 Difference]: Finished difference Result 5291 states and 7904 transitions. [2021-12-27 21:55:56,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:56,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2021-12-27 21:55:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:56,229 INFO L225 Difference]: With dead ends: 5291 [2021-12-27 21:55:56,229 INFO L226 Difference]: Without dead ends: 3498 [2021-12-27 21:55:56,231 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:56,233 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 132 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 542 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 [2021-12-27 21:55:56,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 542 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:55:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-12-27 21:55:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3496. [2021-12-27 21:55:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3495 states have (on average 1.4912732474964234) internal successors, (5212), 3495 states have internal predecessors, (5212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 5212 transitions. [2021-12-27 21:55:56,324 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 5212 transitions. Word has length 241 [2021-12-27 21:55:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:56,324 INFO L470 AbstractCegarLoop]: Abstraction has 3496 states and 5212 transitions. [2021-12-27 21:55:56,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 5212 transitions. [2021-12-27 21:55:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2021-12-27 21:55:56,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:56,332 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 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, 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] [2021-12-27 21:55:56,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-27 21:55:56,332 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash 672015849, now seen corresponding path program 1 times [2021-12-27 21:55:56,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:56,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99434168] [2021-12-27 21:55:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:56,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-12-27 21:55:56,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:56,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99434168] [2021-12-27 21:55:56,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99434168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:56,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:56,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:56,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64214828] [2021-12-27 21:55:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:56,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:56,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:56,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:56,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:56,394 INFO L87 Difference]: Start difference. First operand 3496 states and 5212 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) [2021-12-27 21:55:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:56,551 INFO L93 Difference]: Finished difference Result 6984 states and 10412 transitions. [2021-12-27 21:55:56,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:56,552 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 278 [2021-12-27 21:55:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:56,562 INFO L225 Difference]: With dead ends: 6984 [2021-12-27 21:55:56,562 INFO L226 Difference]: Without dead ends: 3496 [2021-12-27 21:55:56,567 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:56,568 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 301 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 [2021-12-27 21:55:56,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 301 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2021-12-27 21:55:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 3496. [2021-12-27 21:55:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3495 states have (on average 1.4597997138769672) internal successors, (5102), 3495 states have internal predecessors, (5102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 5102 transitions. [2021-12-27 21:55:56,659 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 5102 transitions. Word has length 278 [2021-12-27 21:55:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:56,659 INFO L470 AbstractCegarLoop]: Abstraction has 3496 states and 5102 transitions. [2021-12-27 21:55:56,660 INFO L471 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) [2021-12-27 21:55:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 5102 transitions. [2021-12-27 21:55:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2021-12-27 21:55:56,666 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:56,666 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:56,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-27 21:55:56,666 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:56,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1314633518, now seen corresponding path program 1 times [2021-12-27 21:55:56,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:56,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405438945] [2021-12-27 21:55:56,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:56,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 524 proven. 66 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-12-27 21:55:56,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:56,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405438945] [2021-12-27 21:55:56,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405438945] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:55:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557480523] [2021-12-27 21:55:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:56,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:55:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:55:56,736 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) [2021-12-27 21:55:56,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-27 21:55:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:56,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-27 21:55:56,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:55:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2021-12-27 21:55:57,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:55:57,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557480523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:57,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:55:57,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-12-27 21:55:57,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122053773] [2021-12-27 21:55:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:57,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:57,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:57,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:57,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:55:57,290 INFO L87 Difference]: Start difference. First operand 3496 states and 5102 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) [2021-12-27 21:55:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:57,439 INFO L93 Difference]: Finished difference Result 7374 states and 10802 transitions. [2021-12-27 21:55:57,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:57,440 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 306 [2021-12-27 21:55:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:57,446 INFO L225 Difference]: With dead ends: 7374 [2021-12-27 21:55:57,446 INFO L226 Difference]: Without dead ends: 2111 [2021-12-27 21:55:57,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:55:57,452 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 296 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 [2021-12-27 21:55:57,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 296 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2021-12-27 21:55:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2111. [2021-12-27 21:55:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 2110 states have (on average 1.4398104265402845) internal successors, (3038), 2110 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3038 transitions. [2021-12-27 21:55:57,518 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3038 transitions. Word has length 306 [2021-12-27 21:55:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:57,518 INFO L470 AbstractCegarLoop]: Abstraction has 2111 states and 3038 transitions. [2021-12-27 21:55:57,519 INFO L471 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) [2021-12-27 21:55:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3038 transitions. [2021-12-27 21:55:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2021-12-27 21:55:57,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:57,523 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2021-12-27 21:55:57,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-27 21:55:57,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-27 21:55:57,740 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1538998335, now seen corresponding path program 1 times [2021-12-27 21:55:57,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:57,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324336244] [2021-12-27 21:55:57,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:57,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2021-12-27 21:55:57,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:57,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324336244] [2021-12-27 21:55:57,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324336244] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:57,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:57,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:57,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184937572] [2021-12-27 21:55:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:57,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:57,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:57,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:57,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:57,777 INFO L87 Difference]: Start difference. First operand 2111 states and 3038 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:57,873 INFO L93 Difference]: Finished difference Result 4330 states and 6230 transitions. [2021-12-27 21:55:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:57,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2021-12-27 21:55:57,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:57,892 INFO L225 Difference]: With dead ends: 4330 [2021-12-27 21:55:57,892 INFO L226 Difference]: Without dead ends: 2227 [2021-12-27 21:55:57,895 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:57,896 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 13 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 305 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 [2021-12-27 21:55:57,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 305 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2021-12-27 21:55:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2203. [2021-12-27 21:55:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2202 states have (on average 1.430517711171662) internal successors, (3150), 2202 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3150 transitions. [2021-12-27 21:55:57,951 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3150 transitions. Word has length 307 [2021-12-27 21:55:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:57,952 INFO L470 AbstractCegarLoop]: Abstraction has 2203 states and 3150 transitions. [2021-12-27 21:55:57,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3150 transitions. [2021-12-27 21:55:57,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2021-12-27 21:55:57,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:57,957 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2021-12-27 21:55:57,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-27 21:55:57,958 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:57,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1338757249, now seen corresponding path program 1 times [2021-12-27 21:55:57,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:57,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904363775] [2021-12-27 21:55:57,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:57,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-12-27 21:55:57,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:57,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904363775] [2021-12-27 21:55:57,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904363775] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:57,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:57,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:57,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149045676] [2021-12-27 21:55:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:57,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:57,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:57,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:57,999 INFO L87 Difference]: Start difference. First operand 2203 states and 3150 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:58,121 INFO L93 Difference]: Finished difference Result 4626 states and 6642 transitions. [2021-12-27 21:55:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:58,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 328 [2021-12-27 21:55:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:58,126 INFO L225 Difference]: With dead ends: 4626 [2021-12-27 21:55:58,126 INFO L226 Difference]: Without dead ends: 2431 [2021-12-27 21:55:58,128 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:58,128 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 305 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 [2021-12-27 21:55:58,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 305 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2021-12-27 21:55:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2353. [2021-12-27 21:55:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2352 states have (on average 1.4158163265306123) internal successors, (3330), 2352 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3330 transitions. [2021-12-27 21:55:58,176 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3330 transitions. Word has length 328 [2021-12-27 21:55:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:58,176 INFO L470 AbstractCegarLoop]: Abstraction has 2353 states and 3330 transitions. [2021-12-27 21:55:58,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3330 transitions. [2021-12-27 21:55:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2021-12-27 21:55:58,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:58,182 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:58,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-27 21:55:58,182 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:58,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1183337782, now seen corresponding path program 1 times [2021-12-27 21:55:58,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:58,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613753517] [2021-12-27 21:55:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:58,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2021-12-27 21:55:58,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:58,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613753517] [2021-12-27 21:55:58,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613753517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:58,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:58,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:55:58,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796964289] [2021-12-27 21:55:58,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:58,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:55:58,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:58,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:55:58,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:55:58,229 INFO L87 Difference]: Start difference. First operand 2353 states and 3330 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:58,335 INFO L93 Difference]: Finished difference Result 4746 states and 6726 transitions. [2021-12-27 21:55:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:55:58,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 354 [2021-12-27 21:55:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:58,339 INFO L225 Difference]: With dead ends: 4746 [2021-12-27 21:55:58,340 INFO L226 Difference]: Without dead ends: 2401 [2021-12-27 21:55:58,342 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:58,342 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 19 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 304 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 [2021-12-27 21:55:58,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 304 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2021-12-27 21:55:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2353. [2021-12-27 21:55:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2352 states have (on average 1.3903061224489797) internal successors, (3270), 2352 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3270 transitions. [2021-12-27 21:55:58,408 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3270 transitions. Word has length 354 [2021-12-27 21:55:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:58,408 INFO L470 AbstractCegarLoop]: Abstraction has 2353 states and 3270 transitions. [2021-12-27 21:55:58,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3270 transitions. [2021-12-27 21:55:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-12-27 21:55:58,414 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:58,414 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:58,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-27 21:55:58,414 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash -240397493, now seen corresponding path program 1 times [2021-12-27 21:55:58,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:58,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970750751] [2021-12-27 21:55:58,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:58,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-12-27 21:55:58,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:58,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970750751] [2021-12-27 21:55:58,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970750751] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:55:58,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690619486] [2021-12-27 21:55:58,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:58,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:55:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:55:58,480 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) [2021-12-27 21:55:58,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-27 21:55:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:58,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:55:58,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:55:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-12-27 21:55:59,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:55:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-12-27 21:55:59,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690619486] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:55:59,423 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:55:59,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-27 21:55:59,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301287694] [2021-12-27 21:55:59,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:55:59,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:55:59,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:55:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:55:59,425 INFO L87 Difference]: Start difference. First operand 2353 states and 3270 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:59,840 INFO L93 Difference]: Finished difference Result 6193 states and 8608 transitions. [2021-12-27 21:55:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:55:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 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 372 [2021-12-27 21:55:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:59,846 INFO L225 Difference]: With dead ends: 6193 [2021-12-27 21:55:59,846 INFO L226 Difference]: Without dead ends: 3710 [2021-12-27 21:55:59,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:55:59,848 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 529 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:59,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 637 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:55:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2021-12-27 21:55:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 2380. [2021-12-27 21:55:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 1.3711643547709123) internal successors, (3262), 2379 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3262 transitions. [2021-12-27 21:55:59,902 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3262 transitions. Word has length 372 [2021-12-27 21:55:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:59,902 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 3262 transitions. [2021-12-27 21:55:59,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3262 transitions. [2021-12-27 21:55:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2021-12-27 21:55:59,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:59,908 INFO L514 BasicCegarLoop]: 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, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:59,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-27 21:56:00,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-27 21:56:00,126 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:56:00,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:56:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1847872530, now seen corresponding path program 1 times [2021-12-27 21:56:00,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:56:00,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981262979] [2021-12-27 21:56:00,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:56:00,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:56:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:56:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2021-12-27 21:56:00,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:56:00,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981262979] [2021-12-27 21:56:00,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981262979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:56:00,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:56:00,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:56:00,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417179101] [2021-12-27 21:56:00,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:56:00,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:56:00,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:56:00,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:56:00,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:56:00,177 INFO L87 Difference]: Start difference. First operand 2380 states and 3262 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:56:00,277 INFO L93 Difference]: Finished difference Result 4764 states and 6524 transitions. [2021-12-27 21:56:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:56:00,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2021-12-27 21:56:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:56:00,281 INFO L225 Difference]: With dead ends: 4764 [2021-12-27 21:56:00,281 INFO L226 Difference]: Without dead ends: 2392 [2021-12-27 21:56:00,284 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:56:00,284 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:56:00,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 295 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:56:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2021-12-27 21:56:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2380. [2021-12-27 21:56:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 1.3459436738125263) internal successors, (3202), 2379 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3202 transitions. [2021-12-27 21:56:00,331 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3202 transitions. Word has length 439 [2021-12-27 21:56:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:56:00,331 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 3202 transitions. [2021-12-27 21:56:00,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3202 transitions. [2021-12-27 21:56:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2021-12-27 21:56:00,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:56:00,338 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:56:00,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-27 21:56:00,338 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:56:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:56:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash -118519316, now seen corresponding path program 1 times [2021-12-27 21:56:00,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:56:00,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515045622] [2021-12-27 21:56:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:56:00,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:56:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:56:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2021-12-27 21:56:00,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:56:00,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515045622] [2021-12-27 21:56:00,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515045622] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:56:00,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:56:00,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:56:00,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053741334] [2021-12-27 21:56:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:56:00,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:56:00,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:56:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:56:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:56:00,395 INFO L87 Difference]: Start difference. First operand 2380 states and 3202 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:56:00,514 INFO L93 Difference]: Finished difference Result 4968 states and 6710 transitions. [2021-12-27 21:56:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:56:00,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 472 [2021-12-27 21:56:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:56:00,518 INFO L225 Difference]: With dead ends: 4968 [2021-12-27 21:56:00,518 INFO L226 Difference]: Without dead ends: 2596 [2021-12-27 21:56:00,521 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:56:00,521 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:56:00,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:56:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2021-12-27 21:56:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2584. [2021-12-27 21:56:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2583 states have (on average 1.3302361595044523) internal successors, (3436), 2583 states have internal predecessors, (3436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 3436 transitions. [2021-12-27 21:56:00,568 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 3436 transitions. Word has length 472 [2021-12-27 21:56:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:56:00,568 INFO L470 AbstractCegarLoop]: Abstraction has 2584 states and 3436 transitions. [2021-12-27 21:56:00,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3436 transitions. [2021-12-27 21:56:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2021-12-27 21:56:00,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:56:00,573 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:56:00,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-27 21:56:00,574 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:56:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:56:00,574 INFO L85 PathProgramCache]: Analyzing trace with hash 996725818, now seen corresponding path program 1 times [2021-12-27 21:56:00,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:56:00,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513073862] [2021-12-27 21:56:00,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:56:00,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:56:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:56:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2021-12-27 21:56:00,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:56:00,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513073862] [2021-12-27 21:56:00,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513073862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:56:00,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:56:00,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:56:00,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783320846] [2021-12-27 21:56:00,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:56:00,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:56:00,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:56:00,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:56:00,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:56:00,640 INFO L87 Difference]: Start difference. First operand 2584 states and 3436 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:56:00,748 INFO L93 Difference]: Finished difference Result 5388 states and 7202 transitions. [2021-12-27 21:56:00,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:56:00,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 534 [2021-12-27 21:56:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:56:00,752 INFO L225 Difference]: With dead ends: 5388 [2021-12-27 21:56:00,753 INFO L226 Difference]: Without dead ends: 2812 [2021-12-27 21:56:00,755 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:56:00,755 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:56:00,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:56:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2021-12-27 21:56:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2800. [2021-12-27 21:56:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2800 states, 2799 states have (on average 1.3154698106466596) internal successors, (3682), 2799 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 3682 transitions. [2021-12-27 21:56:00,807 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 3682 transitions. Word has length 534 [2021-12-27 21:56:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:56:00,807 INFO L470 AbstractCegarLoop]: Abstraction has 2800 states and 3682 transitions. [2021-12-27 21:56:00,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3682 transitions. [2021-12-27 21:56:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2021-12-27 21:56:00,813 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:56:00,813 INFO L514 BasicCegarLoop]: 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, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-27 21:56:00,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-27 21:56:00,814 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:56:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:56:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash 712864204, now seen corresponding path program 1 times [2021-12-27 21:56:00,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:56:00,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016758756] [2021-12-27 21:56:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:56:00,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:56:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:56:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-27 21:56:00,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:56:00,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016758756] [2021-12-27 21:56:00,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016758756] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:56:00,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980205330] [2021-12-27 21:56:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:56:00,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:56:00,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:56:00,916 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) [2021-12-27 21:56:00,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-27 21:56:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:56:01,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:56:01,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:56:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-27 21:56:01,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:56:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-27 21:56:02,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980205330] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:56:02,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:56:02,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-27 21:56:02,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455169304] [2021-12-27 21:56:02,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:56:02,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-27 21:56:02,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:56:02,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-27 21:56:02,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:56:02,473 INFO L87 Difference]: Start difference. First operand 2800 states and 3682 transitions. Second operand has 8 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:56:02,790 INFO L93 Difference]: Finished difference Result 5161 states and 6815 transitions. [2021-12-27 21:56:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:56:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 0 states have call successors, (0), 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 600 [2021-12-27 21:56:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:56:02,791 INFO L225 Difference]: With dead ends: 5161 [2021-12-27 21:56:02,791 INFO L226 Difference]: Without dead ends: 0 [2021-12-27 21:56:02,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:56:02,795 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 224 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:56:02,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 792 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:56:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-27 21:56:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-27 21:56:02,796 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) [2021-12-27 21:56:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-27 21:56:02,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 600 [2021-12-27 21:56:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:56:02,797 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-27 21:56:02,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.625) internal successors, (333), 8 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:56:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-27 21:56:02,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-27 21:56:02,799 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 21:56:02,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-27 21:56:03,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:56:03,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-27 21:56:11,244 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2021-12-27 21:56:11,245 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 561) the Hoare annotation is: (let ((.cse6 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.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|))) (.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|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (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 .cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .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 .cse7 .cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)))) [2021-12-27 21:56:11,245 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 572) 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))) [2021-12-27 21:56:11,245 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 582) 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)) [2021-12-27 21:56:11,245 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2021-12-27 21:56:11,245 INFO L861 garLoopResultBuilder]: At program point L631(lines 622 633) the Hoare annotation is: true [2021-12-27 21:56:11,245 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2021-12-27 21:56:11,245 INFO L858 garLoopResultBuilder]: For program point L599(lines 599 603) no Hoare annotation was computed. [2021-12-27 21:56:11,245 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 559) no Hoare annotation was computed. [2021-12-27 21:56:11,245 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 570) no Hoare annotation was computed. [2021-12-27 21:56:11,245 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 581) no Hoare annotation was computed. [2021-12-27 21:56:11,245 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2021-12-27 21:56:11,245 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 552) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L502(lines 502 505) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 558) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 569) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 580) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 559) 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))) [2021-12-27 21:56:11,246 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 570) 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))) [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2021-12-27 21:56:11,246 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2021-12-27 21:56:11,247 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 557) no Hoare annotation was computed. [2021-12-27 21:56:11,247 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 568) no Hoare annotation was computed. [2021-12-27 21:56:11,247 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 579) no Hoare annotation was computed. [2021-12-27 21:56:11,247 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 608) 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)))) [2021-12-27 21:56:11,247 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 546) no Hoare annotation was computed. [2021-12-27 21:56:11,247 INFO L858 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2021-12-27 21:56:11,247 INFO L858 garLoopResultBuilder]: For program point L540-1(lines 540 546) no Hoare annotation was computed. [2021-12-27 21:56:11,247 INFO L858 garLoopResultBuilder]: For program point L507-2(lines 219 552) no Hoare annotation was computed. [2021-12-27 21:56:11,247 INFO L854 garLoopResultBuilder]: At program point L408(lines 399 417) 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))) [2021-12-27 21:56:11,247 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2021-12-27 21:56:11,247 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 568) 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))) [2021-12-27 21:56:11,248 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 581) 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))) [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 556) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 567) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 578) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 589) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L861 garLoopResultBuilder]: At program point L609(lines 109 610) the Hoare annotation is: true [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L543(lines 543 545) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2021-12-27 21:56:11,248 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 557) 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|))))) [2021-12-27 21:56:11,248 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 589) 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))) [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 555) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 566) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 577) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 588) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L854 garLoopResultBuilder]: At program point L216(lines 215 555) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2021-12-27 21:56:11,249 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 567) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-27 21:56:11,249 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 578) 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))) [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L614(lines 614 616) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L614-2(lines 614 616) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L515(lines 515 518) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2021-12-27 21:56:11,249 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L854 garLoopResultBuilder]: At program point L218(lines 217 555) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 565) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 576) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 587) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 552) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 564) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 575) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 586) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2021-12-27 21:56:11,250 INFO L858 garLoopResultBuilder]: For program point L486-2(lines 219 552) no Hoare annotation was computed. [2021-12-27 21:56:11,251 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2021-12-27 21:56:11,251 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2021-12-27 21:56:11,251 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 588) 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))) [2021-12-27 21:56:11,254 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 565) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-27 21:56:11,254 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 576) 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))) [2021-12-27 21:56:11,254 INFO L861 garLoopResultBuilder]: At program point L619(lines 22 621) the Hoare annotation is: true [2021-12-27 21:56:11,255 INFO L854 garLoopResultBuilder]: At program point L553(lines 110 608) 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)))) [2021-12-27 21:56:11,255 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2021-12-27 21:56:11,255 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-12-27 21:56:11,255 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-27 21:56:11,255 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 563) no Hoare annotation was computed. [2021-12-27 21:56:11,255 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 574) no Hoare annotation was computed. [2021-12-27 21:56:11,255 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 585) no Hoare annotation was computed. [2021-12-27 21:56:11,256 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2021-12-27 21:56:11,256 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 525) no Hoare annotation was computed. [2021-12-27 21:56:11,256 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-27 21:56:11,256 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 606) no Hoare annotation was computed. [2021-12-27 21:56:11,256 INFO L854 garLoopResultBuilder]: At program point L524(lines 83 620) the Hoare annotation is: false [2021-12-27 21:56:11,256 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2021-12-27 21:56:11,256 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2021-12-27 21:56:11,256 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 562) no Hoare annotation was computed. [2021-12-27 21:56:11,257 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 573) no Hoare annotation was computed. [2021-12-27 21:56:11,257 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2021-12-27 21:56:11,257 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 584) no Hoare annotation was computed. [2021-12-27 21:56:11,257 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 605) no Hoare annotation was computed. [2021-12-27 21:56:11,257 INFO L858 garLoopResultBuilder]: For program point L492(lines 492 496) no Hoare annotation was computed. [2021-12-27 21:56:11,257 INFO L858 garLoopResultBuilder]: For program point L492-2(lines 492 496) no Hoare annotation was computed. [2021-12-27 21:56:11,257 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 563) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse15 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-27 21:56:11,258 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 574) 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))) [2021-12-27 21:56:11,258 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2021-12-27 21:56:11,258 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2021-12-27 21:56:11,258 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 597) no Hoare annotation was computed. [2021-12-27 21:56:11,258 INFO L858 garLoopResultBuilder]: For program point L526(lines 526 528) no Hoare annotation was computed. [2021-12-27 21:56:11,258 INFO L858 garLoopResultBuilder]: For program point L592-2(lines 591 605) no Hoare annotation was computed. [2021-12-27 21:56:11,258 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2021-12-27 21:56:11,258 INFO L854 garLoopResultBuilder]: At program point L362(lines 338 380) 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))) [2021-12-27 21:56:11,259 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 561) no Hoare annotation was computed. [2021-12-27 21:56:11,259 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 572) no Hoare annotation was computed. [2021-12-27 21:56:11,259 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 583) no Hoare annotation was computed. [2021-12-27 21:56:11,259 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-27 21:56:11,259 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2021-12-27 21:56:11,259 INFO L858 garLoopResultBuilder]: For program point L594(lines 594 596) no Hoare annotation was computed. [2021-12-27 21:56:11,259 INFO L858 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2021-12-27 21:56:11,260 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 419) 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))) [2021-12-27 21:56:11,260 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 584) 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 (= 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 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13))) [2021-12-27 21:56:11,260 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2021-12-27 21:56:11,260 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2021-12-27 21:56:11,260 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2021-12-27 21:56:11,261 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 552) no Hoare annotation was computed. [2021-12-27 21:56:11,261 INFO L858 garLoopResultBuilder]: For program point L530(lines 530 534) no Hoare annotation was computed. [2021-12-27 21:56:11,261 INFO L858 garLoopResultBuilder]: For program point L530-2(lines 530 534) no Hoare annotation was computed. [2021-12-27 21:56:11,261 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2021-12-27 21:56:11,261 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 219 552) no Hoare annotation was computed. [2021-12-27 21:56:11,261 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 560) no Hoare annotation was computed. [2021-12-27 21:56:11,261 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 571) no Hoare annotation was computed. [2021-12-27 21:56:11,262 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 582) no Hoare annotation was computed. [2021-12-27 21:56:11,262 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2021-12-27 21:56:11,262 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 620) no Hoare annotation was computed. [2021-12-27 21:56:11,267 INFO L732 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] [2021-12-27 21:56:11,268 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 21:56:11,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:56:11 BoogieIcfgContainer [2021-12-27 21:56:11,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 21:56:11,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 21:56:11,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 21:56:11,334 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 21:56:11,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:55:52" (3/4) ... [2021-12-27 21:56:11,336 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-27 21:56:11,352 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-27 21:56:11,353 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-27 21:56:11,354 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-27 21:56:11,354 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-27 21:56:11,437 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-27 21:56:11,438 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 21:56:11,438 INFO L158 Benchmark]: Toolchain (without parser) took 19878.68ms. Allocated memory was 50.3MB in the beginning and 432.0MB in the end (delta: 381.7MB). Free memory was 25.4MB in the beginning and 162.5MB in the end (delta: -137.1MB). Peak memory consumption was 243.3MB. Max. memory is 16.1GB. [2021-12-27 21:56:11,438 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 32.4MB in the beginning and 32.3MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:56:11,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.16ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 25.2MB in the beginning and 47.6MB in the end (delta: -22.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-12-27 21:56:11,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.28ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 44.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-27 21:56:11,441 INFO L158 Benchmark]: Boogie Preprocessor took 38.99ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 42.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:56:11,442 INFO L158 Benchmark]: RCFGBuilder took 611.54ms. Allocated memory is still 67.1MB. Free memory was 42.4MB in the beginning and 45.9MB in the end (delta: -3.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2021-12-27 21:56:11,445 INFO L158 Benchmark]: TraceAbstraction took 18758.78ms. Allocated memory was 67.1MB in the beginning and 432.0MB in the end (delta: 364.9MB). Free memory was 45.3MB in the beginning and 179.3MB in the end (delta: -134.1MB). Peak memory consumption was 270.1MB. Max. memory is 16.1GB. [2021-12-27 21:56:11,447 INFO L158 Benchmark]: Witness Printer took 104.32ms. Allocated memory is still 432.0MB. Free memory was 179.3MB in the beginning and 162.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-27 21:56:11,447 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory was 32.4MB in the beginning and 32.3MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.16ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 25.2MB in the beginning and 47.6MB in the end (delta: -22.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.28ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 44.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.99ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 42.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 611.54ms. Allocated memory is still 67.1MB. Free memory was 42.4MB in the beginning and 45.9MB in the end (delta: -3.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18758.78ms. Allocated memory was 67.1MB in the beginning and 432.0MB in the end (delta: 364.9MB). Free memory was 45.3MB in the beginning and 179.3MB in the end (delta: -134.1MB). Peak memory consumption was 270.1MB. Max. memory is 16.1GB. * Witness Printer took 104.32ms. Allocated memory is still 432.0MB. Free memory was 179.3MB in the beginning and 162.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 618]: 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, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 31, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3836 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3836 mSDsluCounter, 8918 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3048 mSDsCounter, 949 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3494 IncrementalHoareTripleChecker+Invalid, 4443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 949 mSolverCounterUnsat, 5870 mSDtfsCounter, 3494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2356 GetRequests, 2308 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3496occurred in iteration=21, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 1685 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 436 NumberOfFragments, 6526 HoareAnnotationTreeSize, 28 FomulaSimplifications, 19074 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 40274 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 7610 NumberOfCodeBlocks, 7610 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 8546 ConstructedInterpolants, 0 QuantifiedInterpolants, 11752 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2061 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 36 InterpolantComputations, 29 PerfectInterpolantSequences, 31311/31533 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: 622]: 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: 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: 399]: 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: 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)) && blastFlag == 1) && !(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)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == 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: 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: 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: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - 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)) && blastFlag == 1) && !(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)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == 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: 387]: 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: 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) && 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 < 8576) && !(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) && 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 == 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) && !(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: 338]: 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: 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: 83]: Loop Invariant Derived loop invariant: 0 - 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)) && blastFlag == 1) && !(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)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == 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)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == 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! [2021-12-27 21:56:11,504 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