./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04e0282fb07d3e422f01aa279aee523182698ba7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:52:02,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:52:02,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:52:02,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:52:02,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:52:02,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:52:02,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:52:02,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:52:02,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:52:02,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:52:02,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:52:02,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:52:02,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:52:02,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:52:02,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:52:02,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:52:02,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:52:02,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:52:02,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:52:02,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:52:02,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:52:02,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:52:02,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:52:02,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:52:02,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:52:02,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:52:02,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:52:02,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:52:02,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:52:02,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:52:02,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:52:02,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:52:02,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:52:02,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:52:02,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:52:02,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:52:02,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:52:02,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:52:02,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:52:02,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:52:02,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:52:02,636 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:52:02,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:52:02,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:52:02,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:52:02,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:52:02,646 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:52:02,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:52:02,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:52:02,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:52:02,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:52:02,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:52:02,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:52:02,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:52:02,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:52:02,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:52:02,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:52:02,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:52:02,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:52:02,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:52:02,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:52:02,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:52:02,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:52:02,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:52:02,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:52:02,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:52:02,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:52:02,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:52:02,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:52:02,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:52:02,649 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:52:02,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer 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(__VERIFIER_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 -> 04e0282fb07d3e422f01aa279aee523182698ba7 [2019-12-07 18:52:02,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:52:02,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:52:02,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:52:02,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:52:02,760 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:52:02,760 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-12-07 18:52:02,797 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/data/f2aa7141b/f71bc5c8d75f47bda133df7b77192a38/FLAG05c766d38 [2019-12-07 18:52:03,270 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:52:03,271 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/sv-benchmarks/c/ssh-simplified/s3_srvr_3.cil.c [2019-12-07 18:52:03,278 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/data/f2aa7141b/f71bc5c8d75f47bda133df7b77192a38/FLAG05c766d38 [2019-12-07 18:52:03,287 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/data/f2aa7141b/f71bc5c8d75f47bda133df7b77192a38 [2019-12-07 18:52:03,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:52:03,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:52:03,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:52:03,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:52:03,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:52:03,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e39bf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03, skipping insertion in model container [2019-12-07 18:52:03,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:52:03,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:52:03,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:52:03,501 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:52:03,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:52:03,556 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:52:03,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03 WrapperNode [2019-12-07 18:52:03,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:52:03,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:52:03,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:52:03,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:52:03,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:52:03,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:52:03,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:52:03,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:52:03,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... [2019-12-07 18:52:03,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:52:03,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:52:03,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:52:03,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:52:03,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:52:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:52:03,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:52:03,735 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:52:04,042 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 18:52:04,042 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 18:52:04,043 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:52:04,043 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:52:04,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:04 BoogieIcfgContainer [2019-12-07 18:52:04,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:52:04,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:52:04,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:52:04,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:52:04,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:52:03" (1/3) ... [2019-12-07 18:52:04,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1ee9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:52:04, skipping insertion in model container [2019-12-07 18:52:04,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:03" (2/3) ... [2019-12-07 18:52:04,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1ee9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:52:04, skipping insertion in model container [2019-12-07 18:52:04,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:04" (3/3) ... [2019-12-07 18:52:04,050 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-12-07 18:52:04,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:52:04,061 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:52:04,068 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:52:04,084 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:52:04,084 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:52:04,084 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:52:04,084 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:52:04,084 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:52:04,084 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:52:04,085 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:52:04,085 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:52:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-12-07 18:52:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:52:04,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:04,103 INFO L410 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] [2019-12-07 18:52:04,103 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:04,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash -91604792, now seen corresponding path program 1 times [2019-12-07 18:52:04,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:04,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516965907] [2019-12-07 18:52:04,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:04,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516965907] [2019-12-07 18:52:04,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:04,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:04,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496935031] [2019-12-07 18:52:04,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:04,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:04,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:04,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:04,283 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-12-07 18:52:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:04,446 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-12-07 18:52:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:04,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 18:52:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:04,456 INFO L225 Difference]: With dead ends: 327 [2019-12-07 18:52:04,456 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 18:52:04,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 18:52:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-12-07 18:52:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 18:52:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-12-07 18:52:04,494 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-12-07 18:52:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:04,495 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-12-07 18:52:04,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-12-07 18:52:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:52:04,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:04,497 INFO L410 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] [2019-12-07 18:52:04,497 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1448034255, now seen corresponding path program 1 times [2019-12-07 18:52:04,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:04,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791905530] [2019-12-07 18:52:04,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:04,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791905530] [2019-12-07 18:52:04,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:04,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:04,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246039870] [2019-12-07 18:52:04,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:04,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:04,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:04,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:04,545 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-12-07 18:52:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:04,669 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-12-07 18:52:04,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:04,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 18:52:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:04,671 INFO L225 Difference]: With dead ends: 379 [2019-12-07 18:52:04,671 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 18:52:04,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:04,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 18:52:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-12-07 18:52:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 18:52:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-12-07 18:52:04,684 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-12-07 18:52:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:04,684 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-12-07 18:52:04,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:04,684 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-12-07 18:52:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 18:52:04,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:04,687 INFO L410 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] [2019-12-07 18:52:04,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:04,687 INFO L82 PathProgramCache]: Analyzing trace with hash 564000227, now seen corresponding path program 1 times [2019-12-07 18:52:04,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:04,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539571032] [2019-12-07 18:52:04,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:04,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539571032] [2019-12-07 18:52:04,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:04,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:04,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964196387] [2019-12-07 18:52:04,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:04,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:04,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:04,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:04,732 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-12-07 18:52:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:04,845 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-12-07 18:52:04,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:04,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 18:52:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:04,847 INFO L225 Difference]: With dead ends: 444 [2019-12-07 18:52:04,848 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 18:52:04,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 18:52:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-12-07 18:52:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 18:52:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-12-07 18:52:04,862 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-12-07 18:52:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:04,862 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-12-07 18:52:04,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-12-07 18:52:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 18:52:04,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:04,864 INFO L410 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] [2019-12-07 18:52:04,865 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:04,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:04,865 INFO L82 PathProgramCache]: Analyzing trace with hash 730826777, now seen corresponding path program 1 times [2019-12-07 18:52:04,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:04,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287529972] [2019-12-07 18:52:04,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:52:04,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287529972] [2019-12-07 18:52:04,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:04,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:04,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493181793] [2019-12-07 18:52:04,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:04,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:04,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:04,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:04,911 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-12-07 18:52:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:05,000 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-12-07 18:52:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:05,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 18:52:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:05,002 INFO L225 Difference]: With dead ends: 492 [2019-12-07 18:52:05,002 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 18:52:05,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 18:52:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-12-07 18:52:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 18:52:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-12-07 18:52:05,012 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-12-07 18:52:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:05,013 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-12-07 18:52:05,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-12-07 18:52:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 18:52:05,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:05,014 INFO L410 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] [2019-12-07 18:52:05,014 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:05,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1628760422, now seen corresponding path program 1 times [2019-12-07 18:52:05,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:05,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893539262] [2019-12-07 18:52:05,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:05,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893539262] [2019-12-07 18:52:05,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:05,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:05,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181860598] [2019-12-07 18:52:05,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:05,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:05,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:05,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,061 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-12-07 18:52:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:05,156 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-12-07 18:52:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:05,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 18:52:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:05,158 INFO L225 Difference]: With dead ends: 551 [2019-12-07 18:52:05,158 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 18:52:05,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 18:52:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-12-07 18:52:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 18:52:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-12-07 18:52:05,167 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-12-07 18:52:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:05,167 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-12-07 18:52:05,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-12-07 18:52:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 18:52:05,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:05,168 INFO L410 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] [2019-12-07 18:52:05,168 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:05,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2100135205, now seen corresponding path program 1 times [2019-12-07 18:52:05,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:05,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482609325] [2019-12-07 18:52:05,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:52:05,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482609325] [2019-12-07 18:52:05,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:05,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:05,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854107695] [2019-12-07 18:52:05,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:05,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:05,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,203 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-12-07 18:52:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:05,272 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-12-07 18:52:05,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:05,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 18:52:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:05,274 INFO L225 Difference]: With dead ends: 591 [2019-12-07 18:52:05,274 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 18:52:05,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 18:52:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-12-07 18:52:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-12-07 18:52:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-12-07 18:52:05,281 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-12-07 18:52:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:05,281 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-12-07 18:52:05,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-12-07 18:52:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 18:52:05,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:05,282 INFO L410 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] [2019-12-07 18:52:05,282 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash 967197197, now seen corresponding path program 1 times [2019-12-07 18:52:05,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:05,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789210814] [2019-12-07 18:52:05,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:05,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789210814] [2019-12-07 18:52:05,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:05,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:05,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195032138] [2019-12-07 18:52:05,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:05,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:05,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:05,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,313 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-12-07 18:52:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:05,413 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-12-07 18:52:05,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:05,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 18:52:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:05,415 INFO L225 Difference]: With dead ends: 593 [2019-12-07 18:52:05,415 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 18:52:05,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 18:52:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-12-07 18:52:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-12-07 18:52:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-12-07 18:52:05,422 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-12-07 18:52:05,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:05,422 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-12-07 18:52:05,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-12-07 18:52:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 18:52:05,423 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:05,423 INFO L410 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] [2019-12-07 18:52:05,423 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:05,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:05,424 INFO L82 PathProgramCache]: Analyzing trace with hash 169031718, now seen corresponding path program 1 times [2019-12-07 18:52:05,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:05,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624770389] [2019-12-07 18:52:05,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 18:52:05,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624770389] [2019-12-07 18:52:05,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:05,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:05,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376710424] [2019-12-07 18:52:05,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:05,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:05,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:05,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,450 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-12-07 18:52:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:05,527 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-12-07 18:52:05,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:05,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-07 18:52:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:05,529 INFO L225 Difference]: With dead ends: 594 [2019-12-07 18:52:05,529 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 18:52:05,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 18:52:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-12-07 18:52:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-07 18:52:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-12-07 18:52:05,537 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-12-07 18:52:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:05,537 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-12-07 18:52:05,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-12-07 18:52:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 18:52:05,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:05,538 INFO L410 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] [2019-12-07 18:52:05,538 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1117186876, now seen corresponding path program 1 times [2019-12-07 18:52:05,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:05,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547059182] [2019-12-07 18:52:05,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:52:05,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547059182] [2019-12-07 18:52:05,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:05,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:05,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390053172] [2019-12-07 18:52:05,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:05,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:05,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:05,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,574 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-12-07 18:52:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:05,670 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-12-07 18:52:05,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:05,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 18:52:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:05,673 INFO L225 Difference]: With dead ends: 634 [2019-12-07 18:52:05,673 INFO L226 Difference]: Without dead ends: 336 [2019-12-07 18:52:05,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-07 18:52:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-12-07 18:52:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-07 18:52:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-12-07 18:52:05,685 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-12-07 18:52:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:05,685 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-12-07 18:52:05,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-12-07 18:52:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:52:05,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:05,687 INFO L410 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] [2019-12-07 18:52:05,687 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1355507800, now seen corresponding path program 1 times [2019-12-07 18:52:05,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:05,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386690886] [2019-12-07 18:52:05,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:52:05,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386690886] [2019-12-07 18:52:05,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:05,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:05,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584910661] [2019-12-07 18:52:05,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:05,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,718 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-12-07 18:52:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:05,828 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-12-07 18:52:05,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:05,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 18:52:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:05,830 INFO L225 Difference]: With dead ends: 663 [2019-12-07 18:52:05,830 INFO L226 Difference]: Without dead ends: 336 [2019-12-07 18:52:05,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-07 18:52:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-12-07 18:52:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-12-07 18:52:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-12-07 18:52:05,839 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-12-07 18:52:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:05,839 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-12-07 18:52:05,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-12-07 18:52:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 18:52:05,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:05,840 INFO L410 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] [2019-12-07 18:52:05,840 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:05,841 INFO L82 PathProgramCache]: Analyzing trace with hash 106299532, now seen corresponding path program 1 times [2019-12-07 18:52:05,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:05,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999077554] [2019-12-07 18:52:05,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:52:05,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999077554] [2019-12-07 18:52:05,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:05,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:05,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050957923] [2019-12-07 18:52:05,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:05,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:05,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:05,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,864 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-12-07 18:52:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:05,961 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-12-07 18:52:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:05,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 18:52:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:05,963 INFO L225 Difference]: With dead ends: 696 [2019-12-07 18:52:05,963 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 18:52:05,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 18:52:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-12-07 18:52:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 18:52:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-12-07 18:52:05,972 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-12-07 18:52:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:05,972 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-12-07 18:52:05,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-12-07 18:52:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 18:52:05,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:05,973 INFO L410 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] [2019-12-07 18:52:05,973 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179864, now seen corresponding path program 1 times [2019-12-07 18:52:05,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:05,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186314847] [2019-12-07 18:52:05,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 18:52:05,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186314847] [2019-12-07 18:52:05,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:05,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:05,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16300165] [2019-12-07 18:52:05,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:05,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:05,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:05,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:05,999 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-12-07 18:52:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:06,112 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-12-07 18:52:06,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:06,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 18:52:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:06,114 INFO L225 Difference]: With dead ends: 723 [2019-12-07 18:52:06,114 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 18:52:06,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 18:52:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-12-07 18:52:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 18:52:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-12-07 18:52:06,124 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-12-07 18:52:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:06,124 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-12-07 18:52:06,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-12-07 18:52:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 18:52:06,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:06,125 INFO L410 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] [2019-12-07 18:52:06,125 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:06,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1408209639, now seen corresponding path program 1 times [2019-12-07 18:52:06,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:06,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694021516] [2019-12-07 18:52:06,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 18:52:06,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694021516] [2019-12-07 18:52:06,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:06,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:06,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465724650] [2019-12-07 18:52:06,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:06,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,149 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-12-07 18:52:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:06,240 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-12-07 18:52:06,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:06,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 18:52:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:06,243 INFO L225 Difference]: With dead ends: 740 [2019-12-07 18:52:06,243 INFO L226 Difference]: Without dead ends: 386 [2019-12-07 18:52:06,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-12-07 18:52:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-12-07 18:52:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 18:52:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-12-07 18:52:06,257 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-12-07 18:52:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:06,258 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-12-07 18:52:06,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-12-07 18:52:06,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 18:52:06,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:06,259 INFO L410 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] [2019-12-07 18:52:06,259 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:06,260 INFO L82 PathProgramCache]: Analyzing trace with hash -628608595, now seen corresponding path program 1 times [2019-12-07 18:52:06,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:06,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889215802] [2019-12-07 18:52:06,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 18:52:06,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889215802] [2019-12-07 18:52:06,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:06,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:06,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530079294] [2019-12-07 18:52:06,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:06,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:06,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:06,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,290 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-12-07 18:52:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:06,388 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-12-07 18:52:06,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:06,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 18:52:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:06,391 INFO L225 Difference]: With dead ends: 761 [2019-12-07 18:52:06,391 INFO L226 Difference]: Without dead ends: 386 [2019-12-07 18:52:06,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-12-07 18:52:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-12-07 18:52:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 18:52:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-12-07 18:52:06,406 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-12-07 18:52:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:06,406 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-12-07 18:52:06,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-12-07 18:52:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 18:52:06,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:06,408 INFO L410 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] [2019-12-07 18:52:06,408 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash 543915161, now seen corresponding path program 1 times [2019-12-07 18:52:06,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:06,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952616912] [2019-12-07 18:52:06,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 18:52:06,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952616912] [2019-12-07 18:52:06,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:06,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:06,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008311401] [2019-12-07 18:52:06,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:06,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:06,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:06,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,450 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-12-07 18:52:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:06,489 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-12-07 18:52:06,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:06,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-12-07 18:52:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:06,494 INFO L225 Difference]: With dead ends: 757 [2019-12-07 18:52:06,494 INFO L226 Difference]: Without dead ends: 755 [2019-12-07 18:52:06,495 INFO L630 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 [2019-12-07 18:52:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-12-07 18:52:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-12-07 18:52:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-12-07 18:52:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-12-07 18:52:06,518 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-12-07 18:52:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:06,519 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-12-07 18:52:06,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-12-07 18:52:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 18:52:06,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:06,520 INFO L410 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, 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] [2019-12-07 18:52:06,520 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1286959367, now seen corresponding path program 1 times [2019-12-07 18:52:06,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:06,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522895589] [2019-12-07 18:52:06,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 18:52:06,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522895589] [2019-12-07 18:52:06,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:06,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:06,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305999791] [2019-12-07 18:52:06,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:06,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:06,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:06,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,555 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-12-07 18:52:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:06,695 INFO L93 Difference]: Finished difference Result 1587 states and 2515 transitions. [2019-12-07 18:52:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:06,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 18:52:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:06,700 INFO L225 Difference]: With dead ends: 1587 [2019-12-07 18:52:06,700 INFO L226 Difference]: Without dead ends: 839 [2019-12-07 18:52:06,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-12-07 18:52:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 831. [2019-12-07 18:52:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 18:52:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1313 transitions. [2019-12-07 18:52:06,724 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1313 transitions. Word has length 121 [2019-12-07 18:52:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:06,724 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1313 transitions. [2019-12-07 18:52:06,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1313 transitions. [2019-12-07 18:52:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 18:52:06,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:06,726 INFO L410 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, 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] [2019-12-07 18:52:06,726 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:06,726 INFO L82 PathProgramCache]: Analyzing trace with hash 203437824, now seen corresponding path program 1 times [2019-12-07 18:52:06,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:06,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767757748] [2019-12-07 18:52:06,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 18:52:06,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767757748] [2019-12-07 18:52:06,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:06,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:06,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919948271] [2019-12-07 18:52:06,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:06,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:06,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:06,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,752 INFO L87 Difference]: Start difference. First operand 831 states and 1313 transitions. Second operand 3 states. [2019-12-07 18:52:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:06,871 INFO L93 Difference]: Finished difference Result 1663 states and 2627 transitions. [2019-12-07 18:52:06,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:06,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-12-07 18:52:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:06,875 INFO L225 Difference]: With dead ends: 1663 [2019-12-07 18:52:06,875 INFO L226 Difference]: Without dead ends: 835 [2019-12-07 18:52:06,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-07 18:52:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2019-12-07 18:52:06,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-07 18:52:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1301 transitions. [2019-12-07 18:52:06,894 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1301 transitions. Word has length 122 [2019-12-07 18:52:06,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:06,894 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1301 transitions. [2019-12-07 18:52:06,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1301 transitions. [2019-12-07 18:52:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 18:52:06,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:06,896 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:06,896 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:06,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:06,896 INFO L82 PathProgramCache]: Analyzing trace with hash -431636595, now seen corresponding path program 1 times [2019-12-07 18:52:06,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:06,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189012079] [2019-12-07 18:52:06,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-07 18:52:06,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189012079] [2019-12-07 18:52:06,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:06,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:06,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400813302] [2019-12-07 18:52:06,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:06,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:06,926 INFO L87 Difference]: Start difference. First operand 827 states and 1301 transitions. Second operand 3 states. [2019-12-07 18:52:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:07,041 INFO L93 Difference]: Finished difference Result 1723 states and 2711 transitions. [2019-12-07 18:52:07,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:07,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-12-07 18:52:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:07,044 INFO L225 Difference]: With dead ends: 1723 [2019-12-07 18:52:07,045 INFO L226 Difference]: Without dead ends: 903 [2019-12-07 18:52:07,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-07 18:52:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 899. [2019-12-07 18:52:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-12-07 18:52:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1409 transitions. [2019-12-07 18:52:07,064 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1409 transitions. Word has length 154 [2019-12-07 18:52:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:07,064 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1409 transitions. [2019-12-07 18:52:07,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1409 transitions. [2019-12-07 18:52:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 18:52:07,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:07,066 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:07,066 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 579021766, now seen corresponding path program 1 times [2019-12-07 18:52:07,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:07,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613495547] [2019-12-07 18:52:07,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-07 18:52:07,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613495547] [2019-12-07 18:52:07,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:07,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:07,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103124658] [2019-12-07 18:52:07,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:07,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,095 INFO L87 Difference]: Start difference. First operand 899 states and 1409 transitions. Second operand 3 states. [2019-12-07 18:52:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:07,201 INFO L93 Difference]: Finished difference Result 1795 states and 2811 transitions. [2019-12-07 18:52:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:07,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-12-07 18:52:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:07,205 INFO L225 Difference]: With dead ends: 1795 [2019-12-07 18:52:07,205 INFO L226 Difference]: Without dead ends: 899 [2019-12-07 18:52:07,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-07 18:52:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 895. [2019-12-07 18:52:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-07 18:52:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1395 transitions. [2019-12-07 18:52:07,224 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1395 transitions. Word has length 155 [2019-12-07 18:52:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:07,225 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1395 transitions. [2019-12-07 18:52:07,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1395 transitions. [2019-12-07 18:52:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 18:52:07,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:07,227 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:07,227 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:07,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:07,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1624823262, now seen corresponding path program 1 times [2019-12-07 18:52:07,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:07,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627006413] [2019-12-07 18:52:07,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-12-07 18:52:07,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627006413] [2019-12-07 18:52:07,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:07,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:07,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272811246] [2019-12-07 18:52:07,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:07,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,274 INFO L87 Difference]: Start difference. First operand 895 states and 1395 transitions. Second operand 3 states. [2019-12-07 18:52:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:07,378 INFO L93 Difference]: Finished difference Result 1855 states and 2891 transitions. [2019-12-07 18:52:07,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:07,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-12-07 18:52:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:07,382 INFO L225 Difference]: With dead ends: 1855 [2019-12-07 18:52:07,382 INFO L226 Difference]: Without dead ends: 967 [2019-12-07 18:52:07,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-12-07 18:52:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 963. [2019-12-07 18:52:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 18:52:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1493 transitions. [2019-12-07 18:52:07,403 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1493 transitions. Word has length 185 [2019-12-07 18:52:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:07,403 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1493 transitions. [2019-12-07 18:52:07,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1493 transitions. [2019-12-07 18:52:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 18:52:07,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:07,405 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:07,406 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1103681317, now seen corresponding path program 1 times [2019-12-07 18:52:07,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:07,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865132155] [2019-12-07 18:52:07,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-12-07 18:52:07,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865132155] [2019-12-07 18:52:07,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:07,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:07,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801628147] [2019-12-07 18:52:07,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:07,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,441 INFO L87 Difference]: Start difference. First operand 963 states and 1493 transitions. Second operand 3 states. [2019-12-07 18:52:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:07,545 INFO L93 Difference]: Finished difference Result 1923 states and 2979 transitions. [2019-12-07 18:52:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:07,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-12-07 18:52:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:07,549 INFO L225 Difference]: With dead ends: 1923 [2019-12-07 18:52:07,549 INFO L226 Difference]: Without dead ends: 963 [2019-12-07 18:52:07,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-07 18:52:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-12-07 18:52:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-12-07 18:52:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1477 transitions. [2019-12-07 18:52:07,569 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1477 transitions. Word has length 186 [2019-12-07 18:52:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:07,570 INFO L462 AbstractCegarLoop]: Abstraction has 959 states and 1477 transitions. [2019-12-07 18:52:07,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1477 transitions. [2019-12-07 18:52:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-12-07 18:52:07,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:07,572 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:07,572 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:07,572 INFO L82 PathProgramCache]: Analyzing trace with hash 550080402, now seen corresponding path program 1 times [2019-12-07 18:52:07,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:07,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259999919] [2019-12-07 18:52:07,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 18:52:07,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259999919] [2019-12-07 18:52:07,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:07,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:07,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585349525] [2019-12-07 18:52:07,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:07,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:07,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,613 INFO L87 Difference]: Start difference. First operand 959 states and 1477 transitions. Second operand 3 states. [2019-12-07 18:52:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:07,711 INFO L93 Difference]: Finished difference Result 1987 states and 3067 transitions. [2019-12-07 18:52:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:07,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-12-07 18:52:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:07,716 INFO L225 Difference]: With dead ends: 1987 [2019-12-07 18:52:07,716 INFO L226 Difference]: Without dead ends: 1035 [2019-12-07 18:52:07,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-12-07 18:52:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-12-07 18:52:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-12-07 18:52:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1541 transitions. [2019-12-07 18:52:07,748 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1541 transitions. Word has length 203 [2019-12-07 18:52:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:07,748 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1541 transitions. [2019-12-07 18:52:07,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1541 transitions. [2019-12-07 18:52:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-12-07 18:52:07,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:07,752 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:07,752 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1613413310, now seen corresponding path program 1 times [2019-12-07 18:52:07,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:07,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618004377] [2019-12-07 18:52:07,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 18:52:07,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618004377] [2019-12-07 18:52:07,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:07,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:07,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915501074] [2019-12-07 18:52:07,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:07,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:07,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:07,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,793 INFO L87 Difference]: Start difference. First operand 1009 states and 1541 transitions. Second operand 3 states. [2019-12-07 18:52:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:07,920 INFO L93 Difference]: Finished difference Result 2037 states and 3113 transitions. [2019-12-07 18:52:07,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:07,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-12-07 18:52:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:07,925 INFO L225 Difference]: With dead ends: 2037 [2019-12-07 18:52:07,925 INFO L226 Difference]: Without dead ends: 1035 [2019-12-07 18:52:07,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-12-07 18:52:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-12-07 18:52:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-12-07 18:52:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1523 transitions. [2019-12-07 18:52:07,953 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1523 transitions. Word has length 204 [2019-12-07 18:52:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:07,953 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1523 transitions. [2019-12-07 18:52:07,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1523 transitions. [2019-12-07 18:52:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-12-07 18:52:07,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:07,956 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:07,956 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:07,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:07,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1583018131, now seen corresponding path program 1 times [2019-12-07 18:52:07,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:07,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484760304] [2019-12-07 18:52:07,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-12-07 18:52:08,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484760304] [2019-12-07 18:52:08,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:08,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:08,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103354661] [2019-12-07 18:52:08,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:08,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:08,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:08,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:08,024 INFO L87 Difference]: Start difference. First operand 1009 states and 1523 transitions. Second operand 3 states. [2019-12-07 18:52:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:08,137 INFO L93 Difference]: Finished difference Result 2019 states and 3045 transitions. [2019-12-07 18:52:08,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:08,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-12-07 18:52:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:08,141 INFO L225 Difference]: With dead ends: 2019 [2019-12-07 18:52:08,141 INFO L226 Difference]: Without dead ends: 1017 [2019-12-07 18:52:08,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-12-07 18:52:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2019-12-07 18:52:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-12-07 18:52:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1511 transitions. [2019-12-07 18:52:08,163 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1511 transitions. Word has length 216 [2019-12-07 18:52:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:08,163 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1511 transitions. [2019-12-07 18:52:08,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1511 transitions. [2019-12-07 18:52:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-07 18:52:08,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:08,165 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:08,165 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:08,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1099234138, now seen corresponding path program 1 times [2019-12-07 18:52:08,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:08,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43906884] [2019-12-07 18:52:08,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-12-07 18:52:08,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43906884] [2019-12-07 18:52:08,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:08,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:08,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744643611] [2019-12-07 18:52:08,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:08,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:08,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:08,212 INFO L87 Difference]: Start difference. First operand 1009 states and 1511 transitions. Second operand 3 states. [2019-12-07 18:52:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:08,316 INFO L93 Difference]: Finished difference Result 2019 states and 3021 transitions. [2019-12-07 18:52:08,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:08,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-12-07 18:52:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:08,322 INFO L225 Difference]: With dead ends: 2019 [2019-12-07 18:52:08,322 INFO L226 Difference]: Without dead ends: 999 [2019-12-07 18:52:08,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-12-07 18:52:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 991. [2019-12-07 18:52:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-12-07 18:52:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1473 transitions. [2019-12-07 18:52:08,350 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1473 transitions. Word has length 217 [2019-12-07 18:52:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:08,350 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1473 transitions. [2019-12-07 18:52:08,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1473 transitions. [2019-12-07 18:52:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-12-07 18:52:08,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:08,352 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:08,352 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:08,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:08,353 INFO L82 PathProgramCache]: Analyzing trace with hash -30789295, now seen corresponding path program 1 times [2019-12-07 18:52:08,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:08,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973197903] [2019-12-07 18:52:08,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-12-07 18:52:08,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973197903] [2019-12-07 18:52:08,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:08,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:08,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610484165] [2019-12-07 18:52:08,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:08,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:08,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:08,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:08,390 INFO L87 Difference]: Start difference. First operand 991 states and 1473 transitions. Second operand 3 states. [2019-12-07 18:52:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:08,482 INFO L93 Difference]: Finished difference Result 2029 states and 3019 transitions. [2019-12-07 18:52:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:08,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-12-07 18:52:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:08,486 INFO L225 Difference]: With dead ends: 2029 [2019-12-07 18:52:08,486 INFO L226 Difference]: Without dead ends: 1045 [2019-12-07 18:52:08,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-07 18:52:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1037. [2019-12-07 18:52:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-12-07 18:52:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1527 transitions. [2019-12-07 18:52:08,508 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1527 transitions. Word has length 224 [2019-12-07 18:52:08,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:08,508 INFO L462 AbstractCegarLoop]: Abstraction has 1037 states and 1527 transitions. [2019-12-07 18:52:08,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1527 transitions. [2019-12-07 18:52:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-12-07 18:52:08,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:08,511 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:08,511 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash 812836165, now seen corresponding path program 1 times [2019-12-07 18:52:08,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:08,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686309050] [2019-12-07 18:52:08,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-12-07 18:52:08,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686309050] [2019-12-07 18:52:08,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:08,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:52:08,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081209162] [2019-12-07 18:52:08,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:08,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:08,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:08,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:08,549 INFO L87 Difference]: Start difference. First operand 1037 states and 1527 transitions. Second operand 3 states. [2019-12-07 18:52:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:08,652 INFO L93 Difference]: Finished difference Result 2075 states and 3053 transitions. [2019-12-07 18:52:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:08,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-12-07 18:52:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:08,656 INFO L225 Difference]: With dead ends: 2075 [2019-12-07 18:52:08,656 INFO L226 Difference]: Without dead ends: 1037 [2019-12-07 18:52:08,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-12-07 18:52:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2019-12-07 18:52:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-12-07 18:52:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1495 transitions. [2019-12-07 18:52:08,677 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1495 transitions. Word has length 225 [2019-12-07 18:52:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:08,678 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 1495 transitions. [2019-12-07 18:52:08,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1495 transitions. [2019-12-07 18:52:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-12-07 18:52:08,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:08,680 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:08,680 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:08,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash 497301888, now seen corresponding path program 1 times [2019-12-07 18:52:08,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:08,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107471309] [2019-12-07 18:52:08,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-12-07 18:52:08,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107471309] [2019-12-07 18:52:08,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643089576] [2019-12-07 18:52:08,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:08,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:52:08,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-12-07 18:52:08,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:52:08,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-12-07 18:52:08,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752694191] [2019-12-07 18:52:08,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:08,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:08,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:08,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:08,881 INFO L87 Difference]: Start difference. First operand 1029 states and 1495 transitions. Second operand 3 states. [2019-12-07 18:52:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:08,929 INFO L93 Difference]: Finished difference Result 2561 states and 3720 transitions. [2019-12-07 18:52:08,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:08,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-12-07 18:52:08,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:08,935 INFO L225 Difference]: With dead ends: 2561 [2019-12-07 18:52:08,935 INFO L226 Difference]: Without dead ends: 1539 [2019-12-07 18:52:08,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-12-07 18:52:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1539. [2019-12-07 18:52:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1539 states. [2019-12-07 18:52:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2235 transitions. [2019-12-07 18:52:08,975 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2235 transitions. Word has length 261 [2019-12-07 18:52:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:08,975 INFO L462 AbstractCegarLoop]: Abstraction has 1539 states and 2235 transitions. [2019-12-07 18:52:08,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2235 transitions. [2019-12-07 18:52:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-12-07 18:52:08,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:08,978 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:52:09,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:09,179 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1933393930, now seen corresponding path program 1 times [2019-12-07 18:52:09,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:09,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919280403] [2019-12-07 18:52:09,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-12-07 18:52:09,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919280403] [2019-12-07 18:52:09,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:09,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:09,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011598382] [2019-12-07 18:52:09,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:09,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:09,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:09,270 INFO L87 Difference]: Start difference. First operand 1539 states and 2235 transitions. Second operand 3 states. [2019-12-07 18:52:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:09,349 INFO L93 Difference]: Finished difference Result 4522 states and 6563 transitions. [2019-12-07 18:52:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:09,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-12-07 18:52:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:09,361 INFO L225 Difference]: With dead ends: 4522 [2019-12-07 18:52:09,361 INFO L226 Difference]: Without dead ends: 2990 [2019-12-07 18:52:09,363 INFO L630 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 [2019-12-07 18:52:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2019-12-07 18:52:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2988. [2019-12-07 18:52:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-07 18:52:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 4329 transitions. [2019-12-07 18:52:09,466 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 4329 transitions. Word has length 268 [2019-12-07 18:52:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:09,467 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 4329 transitions. [2019-12-07 18:52:09,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 4329 transitions. [2019-12-07 18:52:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-12-07 18:52:09,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:09,471 INFO L410 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] [2019-12-07 18:52:09,471 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:09,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:09,472 INFO L82 PathProgramCache]: Analyzing trace with hash -333999477, now seen corresponding path program 1 times [2019-12-07 18:52:09,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:09,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211022213] [2019-12-07 18:52:09,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-12-07 18:52:09,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211022213] [2019-12-07 18:52:09,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:09,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:09,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307330993] [2019-12-07 18:52:09,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:09,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:09,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:09,537 INFO L87 Difference]: Start difference. First operand 2988 states and 4329 transitions. Second operand 3 states. [2019-12-07 18:52:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:09,673 INFO L93 Difference]: Finished difference Result 6089 states and 8839 transitions. [2019-12-07 18:52:09,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:09,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-12-07 18:52:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:09,681 INFO L225 Difference]: With dead ends: 6089 [2019-12-07 18:52:09,681 INFO L226 Difference]: Without dead ends: 1991 [2019-12-07 18:52:09,684 INFO L630 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 [2019-12-07 18:52:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-07 18:52:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1971. [2019-12-07 18:52:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-12-07 18:52:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2807 transitions. [2019-12-07 18:52:09,728 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2807 transitions. Word has length 305 [2019-12-07 18:52:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:09,728 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2807 transitions. [2019-12-07 18:52:09,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2807 transitions. [2019-12-07 18:52:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-12-07 18:52:09,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:09,733 INFO L410 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] [2019-12-07 18:52:09,733 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:09,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1127702344, now seen corresponding path program 1 times [2019-12-07 18:52:09,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:09,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239089911] [2019-12-07 18:52:09,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-12-07 18:52:09,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239089911] [2019-12-07 18:52:09,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996301628] [2019-12-07 18:52:09,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:09,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:52:09,912 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-12-07 18:52:10,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:52:10,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:52:10,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291216480] [2019-12-07 18:52:10,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:10,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:10,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:10,011 INFO L87 Difference]: Start difference. First operand 1971 states and 2807 transitions. Second operand 4 states. [2019-12-07 18:52:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:10,232 INFO L93 Difference]: Finished difference Result 4561 states and 6484 transitions. [2019-12-07 18:52:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:52:10,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-12-07 18:52:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:10,242 INFO L225 Difference]: With dead ends: 4561 [2019-12-07 18:52:10,242 INFO L226 Difference]: Without dead ends: 2553 [2019-12-07 18:52:10,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-12-07 18:52:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 1942. [2019-12-07 18:52:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-12-07 18:52:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-12-07 18:52:10,294 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 371 [2019-12-07 18:52:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:10,295 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-12-07 18:52:10,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-12-07 18:52:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-12-07 18:52:10,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:10,304 INFO L410 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] [2019-12-07 18:52:10,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:10,505 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash -722402039, now seen corresponding path program 1 times [2019-12-07 18:52:10,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:10,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153678758] [2019-12-07 18:52:10,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 18:52:10,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153678758] [2019-12-07 18:52:10,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918965488] [2019-12-07 18:52:10,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:10,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:52:10,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:52:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-12-07 18:52:11,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:52:11,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 18:52:11,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048598905] [2019-12-07 18:52:11,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:52:11,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:11,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:11,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:11,021 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 4 states. [2019-12-07 18:52:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:11,228 INFO L93 Difference]: Finished difference Result 4797 states and 6654 transitions. [2019-12-07 18:52:11,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:11,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2019-12-07 18:52:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:11,236 INFO L225 Difference]: With dead ends: 4797 [2019-12-07 18:52:11,236 INFO L226 Difference]: Without dead ends: 2724 [2019-12-07 18:52:11,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2019-12-07 18:52:11,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1942. [2019-12-07 18:52:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-12-07 18:52:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-12-07 18:52:11,283 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 599 [2019-12-07 18:52:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:11,284 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-12-07 18:52:11,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:52:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-12-07 18:52:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-12-07 18:52:11,288 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:11,288 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 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] [2019-12-07 18:52:11,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:52:11,489 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash 914135564, now seen corresponding path program 1 times [2019-12-07 18:52:11,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:11,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578106479] [2019-12-07 18:52:11,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-12-07 18:52:11,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578106479] [2019-12-07 18:52:11,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:11,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:11,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210362183] [2019-12-07 18:52:11,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:11,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:11,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:11,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:11,735 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 3 states. [2019-12-07 18:52:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:11,869 INFO L93 Difference]: Finished difference Result 3917 states and 5403 transitions. [2019-12-07 18:52:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:11,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2019-12-07 18:52:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:11,874 INFO L225 Difference]: With dead ends: 3917 [2019-12-07 18:52:11,875 INFO L226 Difference]: Without dead ends: 1982 [2019-12-07 18:52:11,877 INFO L630 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 [2019-12-07 18:52:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-12-07 18:52:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1942. [2019-12-07 18:52:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-12-07 18:52:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2663 transitions. [2019-12-07 18:52:11,925 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2663 transitions. Word has length 669 [2019-12-07 18:52:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:11,926 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2663 transitions. [2019-12-07 18:52:11,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2663 transitions. [2019-12-07 18:52:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-12-07 18:52:11,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:11,930 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 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] [2019-12-07 18:52:11,931 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:11,931 INFO L82 PathProgramCache]: Analyzing trace with hash 551234930, now seen corresponding path program 1 times [2019-12-07 18:52:11,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:11,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740858356] [2019-12-07 18:52:11,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-12-07 18:52:12,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740858356] [2019-12-07 18:52:12,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:12,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:12,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488406315] [2019-12-07 18:52:12,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:12,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:12,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:12,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:12,224 INFO L87 Difference]: Start difference. First operand 1942 states and 2663 transitions. Second operand 3 states. [2019-12-07 18:52:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:12,371 INFO L93 Difference]: Finished difference Result 3892 states and 5332 transitions. [2019-12-07 18:52:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:12,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-12-07 18:52:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:12,374 INFO L225 Difference]: With dead ends: 3892 [2019-12-07 18:52:12,374 INFO L226 Difference]: Without dead ends: 1957 [2019-12-07 18:52:12,376 INFO L630 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 [2019-12-07 18:52:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-12-07 18:52:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1929. [2019-12-07 18:52:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-12-07 18:52:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2604 transitions. [2019-12-07 18:52:12,412 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2604 transitions. Word has length 683 [2019-12-07 18:52:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:12,412 INFO L462 AbstractCegarLoop]: Abstraction has 1929 states and 2604 transitions. [2019-12-07 18:52:12,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2604 transitions. [2019-12-07 18:52:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-12-07 18:52:12,416 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:12,416 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2019-12-07 18:52:12,416 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:12,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1986025501, now seen corresponding path program 1 times [2019-12-07 18:52:12,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:12,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573280952] [2019-12-07 18:52:12,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-12-07 18:52:12,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573280952] [2019-12-07 18:52:12,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:12,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:12,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472853904] [2019-12-07 18:52:12,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:12,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:12,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:12,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:12,682 INFO L87 Difference]: Start difference. First operand 1929 states and 2604 transitions. Second operand 3 states. [2019-12-07 18:52:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:12,793 INFO L93 Difference]: Finished difference Result 3921 states and 5296 transitions. [2019-12-07 18:52:12,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:12,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2019-12-07 18:52:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:12,796 INFO L225 Difference]: With dead ends: 3921 [2019-12-07 18:52:12,796 INFO L226 Difference]: Without dead ends: 1981 [2019-12-07 18:52:12,798 INFO L630 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 [2019-12-07 18:52:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-07 18:52:12,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-12-07 18:52:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-12-07 18:52:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2649 transitions. [2019-12-07 18:52:12,835 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2649 transitions. Word has length 711 [2019-12-07 18:52:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:12,835 INFO L462 AbstractCegarLoop]: Abstraction has 1971 states and 2649 transitions. [2019-12-07 18:52:12,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2649 transitions. [2019-12-07 18:52:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2019-12-07 18:52:12,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:52:12,840 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2019-12-07 18:52:12,840 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:52:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash -120199639, now seen corresponding path program 1 times [2019-12-07 18:52:12,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:12,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454604684] [2019-12-07 18:52:12,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-12-07 18:52:13,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454604684] [2019-12-07 18:52:13,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:13,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:13,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165651541] [2019-12-07 18:52:13,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:52:13,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:13,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:13,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:13,167 INFO L87 Difference]: Start difference. First operand 1971 states and 2649 transitions. Second operand 3 states. [2019-12-07 18:52:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:13,249 INFO L93 Difference]: Finished difference Result 2519 states and 3369 transitions. [2019-12-07 18:52:13,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:13,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 726 [2019-12-07 18:52:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:52:13,250 INFO L225 Difference]: With dead ends: 2519 [2019-12-07 18:52:13,250 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:52:13,252 INFO L630 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 [2019-12-07 18:52:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:52:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:52:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:52:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:52:13,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2019-12-07 18:52:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:52:13,252 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:52:13,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:52:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:52:13,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:52:13,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:52:13,481 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-12-07 18:52:13,614 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2019-12-07 18:52:14,040 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 18:52:14,373 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-12-07 18:52:14,577 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 18:52:14,795 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-12-07 18:52:14,953 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-12-07 18:52:15,191 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 18:52:15,594 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-12-07 18:52:15,790 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-12-07 18:52:16,186 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-12-07 18:52:16,381 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 18:52:16,579 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-12-07 18:52:16,877 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-12-07 18:52:17,183 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-12-07 18:52:17,418 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 18:52:17,629 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 18:52:17,826 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 18:52:18,131 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 18:52:18,381 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 18:52:18,603 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-12-07 18:52:18,806 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-12-07 18:52:18,809 INFO L249 CegarLoopResult]: At program point L597(lines 97 598) the Hoare annotation is: true [2019-12-07 18:52:18,809 INFO L246 CegarLoopResult]: For program point L531(lines 531 533) no Hoare annotation was computed. [2019-12-07 18:52:18,809 INFO L246 CegarLoopResult]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-12-07 18:52:18,809 INFO L246 CegarLoopResult]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-12-07 18:52:18,809 INFO L246 CegarLoopResult]: For program point L333(lines 333 363) no Hoare annotation was computed. [2019-12-07 18:52:18,809 INFO L242 CegarLoopResult]: At program point L201(lines 197 545) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-12-07 18:52:18,810 INFO L242 CegarLoopResult]: At program point L102(lines 101 577) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-12-07 18:52:18,810 INFO L246 CegarLoopResult]: For program point L203(lines 203 543) no Hoare annotation was computed. [2019-12-07 18:52:18,810 INFO L246 CegarLoopResult]: For program point L170(lines 170 554) no Hoare annotation was computed. [2019-12-07 18:52:18,810 INFO L246 CegarLoopResult]: For program point L137(lines 137 565) no Hoare annotation was computed. [2019-12-07 18:52:18,810 INFO L246 CegarLoopResult]: For program point L104(lines 104 576) no Hoare annotation was computed. [2019-12-07 18:52:18,810 INFO L246 CegarLoopResult]: For program point L303(lines 303 310) no Hoare annotation was computed. [2019-12-07 18:52:18,810 INFO L246 CegarLoopResult]: For program point L303-2(lines 303 310) no Hoare annotation was computed. [2019-12-07 18:52:18,810 INFO L242 CegarLoopResult]: At program point L204(lines 203 543) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 18:52:18,810 INFO L242 CegarLoopResult]: At program point L171(lines 167 555) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse9 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse5 .cse6 .cse7 .cse10 .cse11 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-12-07 18:52:18,811 INFO L242 CegarLoopResult]: At program point L138(lines 134 566) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L602(lines 602 604) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L602-2(lines 602 604) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L503(lines 503 506) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L338(lines 338 361) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L242 CegarLoopResult]: At program point L206(lines 205 543) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L173(lines 173 553) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L140(lines 140 564) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L107(lines 107 575) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L273-2(lines 207 540) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L307(lines 307 309) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-12-07 18:52:18,811 INFO L246 CegarLoopResult]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-12-07 18:52:18,812 INFO L246 CegarLoopResult]: For program point L176(lines 176 552) no Hoare annotation was computed. [2019-12-07 18:52:18,812 INFO L246 CegarLoopResult]: For program point L143(lines 143 563) no Hoare annotation was computed. [2019-12-07 18:52:18,812 INFO L246 CegarLoopResult]: For program point L110(lines 110 574) no Hoare annotation was computed. [2019-12-07 18:52:18,812 INFO L246 CegarLoopResult]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-12-07 18:52:18,812 INFO L246 CegarLoopResult]: For program point L474-2(lines 207 540) no Hoare annotation was computed. [2019-12-07 18:52:18,812 INFO L246 CegarLoopResult]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-12-07 18:52:18,812 INFO L246 CegarLoopResult]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-12-07 18:52:18,812 INFO L242 CegarLoopResult]: At program point L210(lines 104 576) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2019-12-07 18:52:18,812 INFO L242 CegarLoopResult]: At program point L177(lines 173 553) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,812 INFO L242 CegarLoopResult]: At program point L144(lines 140 564) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,812 INFO L249 CegarLoopResult]: At program point L607(lines 10 609) the Hoare annotation is: true [2019-12-07 18:52:18,813 INFO L242 CegarLoopResult]: At program point L541(lines 98 596) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse2 .cse3 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))))) [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L179(lines 179 551) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L146(lines 146 562) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L113(lines 113 573) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L578(lines 578 594) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L242 CegarLoopResult]: At program point L512(lines 71 608) the Hoare annotation is: false [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L182(lines 182 550) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L149(lines 149 561) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-12-07 18:52:18,813 INFO L246 CegarLoopResult]: For program point L116(lines 116 572) no Hoare annotation was computed. [2019-12-07 18:52:18,814 INFO L246 CegarLoopResult]: For program point L579(lines 579 593) no Hoare annotation was computed. [2019-12-07 18:52:18,814 INFO L246 CegarLoopResult]: For program point L480(lines 480 484) no Hoare annotation was computed. [2019-12-07 18:52:18,814 INFO L246 CegarLoopResult]: For program point L480-2(lines 480 484) no Hoare annotation was computed. [2019-12-07 18:52:18,814 INFO L242 CegarLoopResult]: At program point L183(lines 179 551) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,814 INFO L242 CegarLoopResult]: At program point L150(lines 146 562) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,814 INFO L246 CegarLoopResult]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-12-07 18:52:18,814 INFO L246 CegarLoopResult]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-12-07 18:52:18,814 INFO L246 CegarLoopResult]: For program point L580(lines 580 585) no Hoare annotation was computed. [2019-12-07 18:52:18,814 INFO L246 CegarLoopResult]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-12-07 18:52:18,814 INFO L246 CegarLoopResult]: For program point L580-2(lines 579 593) no Hoare annotation was computed. [2019-12-07 18:52:18,814 INFO L246 CegarLoopResult]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L242 CegarLoopResult]: At program point L350(lines 326 368) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L185(lines 185 549) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L152(lines 152 560) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L119(lines 119 571) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L582(lines 582 584) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L242 CegarLoopResult]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,815 INFO L242 CegarLoopResult]: At program point L120(lines 116 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse9 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse5 .cse6 .cse10 .cse7 .cse11 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L286(lines 286 288) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L286-2(lines 207 540) no Hoare annotation was computed. [2019-12-07 18:52:18,815 INFO L246 CegarLoopResult]: For program point L518(lines 518 522) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L246 CegarLoopResult]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L246 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L246 CegarLoopResult]: For program point L320-2(lines 207 540) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L246 CegarLoopResult]: For program point L188(lines 188 548) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L246 CegarLoopResult]: For program point L155(lines 155 559) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L246 CegarLoopResult]: For program point L122(lines 122 570) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L246 CegarLoopResult]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L246 CegarLoopResult]: For program point L89-1(lines 71 608) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L246 CegarLoopResult]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-12-07 18:52:18,816 INFO L242 CegarLoopResult]: At program point L189(lines 185 549) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21))) [2019-12-07 18:52:18,816 INFO L242 CegarLoopResult]: At program point L156(lines 152 560) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,816 INFO L242 CegarLoopResult]: At program point L123(lines 122 570) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L249 CegarLoopResult]: At program point L619(lines 610 621) the Hoare annotation is: true [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L587(lines 587 591) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L191(lines 191 547) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L158(lines 158 558) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L125(lines 125 569) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L225-2(lines 207 540) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L490(lines 490 493) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L425-1(lines 425 433) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L194(lines 194 546) no Hoare annotation was computed. [2019-12-07 18:52:18,817 INFO L246 CegarLoopResult]: For program point L161(lines 161 557) no Hoare annotation was computed. [2019-12-07 18:52:18,818 INFO L246 CegarLoopResult]: For program point L128(lines 128 568) no Hoare annotation was computed. [2019-12-07 18:52:18,818 INFO L242 CegarLoopResult]: At program point L195(lines 191 547) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,818 INFO L242 CegarLoopResult]: At program point L162(lines 158 558) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,818 INFO L246 CegarLoopResult]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-12-07 18:52:18,818 INFO L246 CegarLoopResult]: For program point L329(lines 329 367) no Hoare annotation was computed. [2019-12-07 18:52:18,818 INFO L246 CegarLoopResult]: For program point L197(lines 197 545) no Hoare annotation was computed. [2019-12-07 18:52:18,818 INFO L246 CegarLoopResult]: For program point L164(lines 164 556) no Hoare annotation was computed. [2019-12-07 18:52:18,818 INFO L246 CegarLoopResult]: For program point L131(lines 131 567) no Hoare annotation was computed. [2019-12-07 18:52:18,818 INFO L242 CegarLoopResult]: At program point L98-2(lines 98 596) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse2 .cse3 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))))) [2019-12-07 18:52:18,818 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-12-07 18:52:18,818 INFO L246 CegarLoopResult]: For program point L528(lines 528 534) no Hoare annotation was computed. [2019-12-07 18:52:18,819 INFO L246 CegarLoopResult]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-12-07 18:52:18,819 INFO L246 CegarLoopResult]: For program point L528-1(lines 528 534) no Hoare annotation was computed. [2019-12-07 18:52:18,819 INFO L246 CegarLoopResult]: For program point L495-2(lines 207 540) no Hoare annotation was computed. [2019-12-07 18:52:18,819 INFO L242 CegarLoopResult]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,819 INFO L246 CegarLoopResult]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-12-07 18:52:18,819 INFO L242 CegarLoopResult]: At program point L165(lines 164 556) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse8 .cse11 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-12-07 18:52:18,819 INFO L242 CegarLoopResult]: At program point L132(lines 125 569) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse13) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse8 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse11 .cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 18:52:18,819 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 18:52:18,819 INFO L246 CegarLoopResult]: For program point L332(lines 332 366) no Hoare annotation was computed. [2019-12-07 18:52:18,819 INFO L246 CegarLoopResult]: For program point L332-1(lines 332 366) no Hoare annotation was computed. [2019-12-07 18:52:18,819 INFO L246 CegarLoopResult]: For program point L200(lines 200 544) no Hoare annotation was computed. [2019-12-07 18:52:18,820 INFO L246 CegarLoopResult]: For program point L167(lines 167 555) no Hoare annotation was computed. [2019-12-07 18:52:18,820 INFO L246 CegarLoopResult]: For program point L134(lines 134 566) no Hoare annotation was computed. [2019-12-07 18:52:18,820 INFO L246 CegarLoopResult]: For program point L101(lines 101 577) no Hoare annotation was computed. [2019-12-07 18:52:18,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:52:18 BoogieIcfgContainer [2019-12-07 18:52:18,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:52:18,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:52:18,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:52:18,865 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:52:18,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:04" (3/4) ... [2019-12-07 18:52:18,868 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:52:18,885 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:52:18,886 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:52:18,972 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1f933c8d-dbb0-429c-9789-ee396132dfb6/bin/uautomizer/witness.graphml [2019-12-07 18:52:18,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:52:18,973 INFO L168 Benchmark]: Toolchain (without parser) took 15683.20 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 985.7 MB). Free memory was 943.6 MB in the beginning and 965.1 MB in the end (delta: -21.5 MB). Peak memory consumption was 964.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:18,973 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:52:18,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:18,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:52:18,974 INFO L168 Benchmark]: Boogie Preprocessor took 26.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:18,974 INFO L168 Benchmark]: RCFGBuilder took 423.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:18,975 INFO L168 Benchmark]: TraceAbstraction took 14818.95 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 899.7 MB). Free memory was 1.0 GB in the beginning and 996.7 MB in the end (delta: 17.9 MB). Peak memory consumption was 929.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:18,975 INFO L168 Benchmark]: Witness Printer took 107.53 ms. Allocated memory is still 2.0 GB. Free memory was 996.7 MB in the beginning and 965.1 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:52:18,976 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 423.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14818.95 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 899.7 MB). Free memory was 1.0 GB in the beginning and 996.7 MB in the end (delta: 17.9 MB). Peak memory consumption was 929.7 MB. Max. memory is 11.5 GB. * Witness Printer took 107.53 ms. Allocated memory is still 2.0 GB. Free memory was 996.7 MB in the beginning and 965.1 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8577)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8577)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 9.1s, OverallIterations: 36, TraceHistogramMax: 25, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.5s, HoareTripleCheckerStatistics: 5516 SDtfs, 4845 SDslu, 1841 SDs, 0 SdLazy, 3378 SolverSat, 1372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1317 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2988occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 36 MinimizatonAttempts, 1659 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 207 NumberOfFragments, 3512 HoareAnnotationTreeSize, 28 FomulaSimplifications, 29359 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7815 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 9347 NumberOfCodeBlocks, 9347 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9308 ConstructedInterpolants, 0 QuantifiedInterpolants, 4566453 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1935 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 39 InterpolantComputations, 34 PerfectInterpolantSequences, 40483/40613 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...