./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/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 eba2b941566e2fb2ae010597707522fdb9036fd8 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:15:23,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:15:23,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:15:23,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:15:23,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:15:23,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:15:23,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:15:23,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:15:23,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:15:23,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:15:23,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:15:23,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:15:23,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:15:23,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:15:23,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:15:23,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:15:23,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:15:23,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:15:23,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:15:23,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:15:23,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:15:23,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:15:23,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:15:23,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:15:23,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:15:23,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:15:23,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:15:23,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:15:23,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:15:23,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:15:23,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:15:23,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:15:23,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:15:23,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:15:23,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:15:23,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:15:23,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:15:23,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:15:23,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:15:23,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:15:23,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:15:23,981 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:15:23,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:15:23,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:15:23,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:15:23,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:15:23,999 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:15:24,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:15:24,000 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:15:24,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:15:24,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:15:24,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:15:24,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:15:24,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:15:24,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:15:24,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:15:24,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:15:24,002 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:15:24,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:15:24,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:15:24,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:15:24,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:15:24,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:15:24,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:15:24,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:15:24,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:15:24,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:15:24,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:15:24,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:15:24,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:15:24,006 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_506f456e-2030-4aac-8b5e-bcd323e5ac33/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 -> eba2b941566e2fb2ae010597707522fdb9036fd8 [2019-11-19 23:15:24,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:15:24,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:15:24,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:15:24,199 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:15:24,199 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:15:24,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-19 23:15:24,262 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/data/2bac3395d/8c03173c00ec4c19bbf2f779f1ced6f8/FLAG0965d75a1 [2019-11-19 23:15:24,819 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:15:24,820 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-2.c [2019-11-19 23:15:24,833 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/data/2bac3395d/8c03173c00ec4c19bbf2f779f1ced6f8/FLAG0965d75a1 [2019-11-19 23:15:25,107 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/data/2bac3395d/8c03173c00ec4c19bbf2f779f1ced6f8 [2019-11-19 23:15:25,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:15:25,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:15:25,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:15:25,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:15:25,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:15:25,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5087b74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25, skipping insertion in model container [2019-11-19 23:15:25,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,137 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:15:25,183 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:15:25,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:15:25,540 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:15:25,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:15:25,689 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:15:25,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25 WrapperNode [2019-11-19 23:15:25,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:15:25,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:15:25,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:15:25,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:15:25,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:15:25,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:15:25,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:15:25,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:15:25,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... [2019-11-19 23:15:25,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:15:25,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:15:25,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:15:25,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:15:25,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/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-11-19 23:15:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:15:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:15:26,061 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:15:26,778 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-19 23:15:26,779 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-19 23:15:26,780 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:15:26,781 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-19 23:15:26,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:26 BoogieIcfgContainer [2019-11-19 23:15:26,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:15:26,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:15:26,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:15:26,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:15:26,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:15:25" (1/3) ... [2019-11-19 23:15:26,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69874934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:26, skipping insertion in model container [2019-11-19 23:15:26,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:25" (2/3) ... [2019-11-19 23:15:26,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69874934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:26, skipping insertion in model container [2019-11-19 23:15:26,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:26" (3/3) ... [2019-11-19 23:15:26,791 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-11-19 23:15:26,802 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:15:26,810 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:15:26,821 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:15:26,847 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:15:26,847 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:15:26,847 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:15:26,847 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:15:26,848 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:15:26,848 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:15:26,848 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:15:26,848 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:15:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-11-19 23:15:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 23:15:26,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:26,882 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-11-19 23:15:26,882 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:26,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:26,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126418, now seen corresponding path program 1 times [2019-11-19 23:15:26,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:26,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201574306] [2019-11-19 23:15:26,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:15:27,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201574306] [2019-11-19 23:15:27,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:27,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:27,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411833882] [2019-11-19 23:15:27,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:27,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:27,195 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-11-19 23:15:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:27,636 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-11-19 23:15:27,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:27,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-19 23:15:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:27,663 INFO L225 Difference]: With dead ends: 332 [2019-11-19 23:15:27,663 INFO L226 Difference]: Without dead ends: 177 [2019-11-19 23:15:27,670 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-11-19 23:15:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-19 23:15:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-11-19 23:15:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-19 23:15:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-11-19 23:15:27,773 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-11-19 23:15:27,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:27,773 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-11-19 23:15:27,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-11-19 23:15:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 23:15:27,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:27,777 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, 1] [2019-11-19 23:15:27,777 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:27,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:27,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296619, now seen corresponding path program 1 times [2019-11-19 23:15:27,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:27,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939317596] [2019-11-19 23:15:27,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:15:27,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939317596] [2019-11-19 23:15:27,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:27,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:27,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213908968] [2019-11-19 23:15:27,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:27,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:27,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:27,948 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-11-19 23:15:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:28,264 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-11-19 23:15:28,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:28,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-19 23:15:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:28,268 INFO L225 Difference]: With dead ends: 384 [2019-11-19 23:15:28,268 INFO L226 Difference]: Without dead ends: 218 [2019-11-19 23:15:28,271 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-11-19 23:15:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-19 23:15:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-11-19 23:15:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-19 23:15:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-11-19 23:15:28,291 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-11-19 23:15:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:28,292 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-11-19 23:15:28,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-11-19 23:15:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-19 23:15:28,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:28,297 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, 1, 1] [2019-11-19 23:15:28,297 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:28,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:28,298 INFO L82 PathProgramCache]: Analyzing trace with hash -128378241, now seen corresponding path program 1 times [2019-11-19 23:15:28,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:28,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586927463] [2019-11-19 23:15:28,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:15:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586927463] [2019-11-19 23:15:28,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:28,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:28,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201513168] [2019-11-19 23:15:28,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:28,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:28,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:28,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:28,434 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-11-19 23:15:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:28,704 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-11-19 23:15:28,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:28,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-19 23:15:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:28,709 INFO L225 Difference]: With dead ends: 448 [2019-11-19 23:15:28,709 INFO L226 Difference]: Without dead ends: 243 [2019-11-19 23:15:28,711 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-11-19 23:15:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-19 23:15:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-19 23:15:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-19 23:15:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-11-19 23:15:28,749 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-11-19 23:15:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:28,749 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-11-19 23:15:28,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-11-19 23:15:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 23:15:28,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:28,755 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, 1] [2019-11-19 23:15:28,755 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1989171317, now seen corresponding path program 1 times [2019-11-19 23:15:28,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:28,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250579022] [2019-11-19 23:15:28,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:15:28,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250579022] [2019-11-19 23:15:28,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:28,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:28,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654181305] [2019-11-19 23:15:28,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:28,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:28,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:28,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:28,831 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-11-19 23:15:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:29,110 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-11-19 23:15:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:29,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-19 23:15:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:29,114 INFO L225 Difference]: With dead ends: 525 [2019-11-19 23:15:29,114 INFO L226 Difference]: Without dead ends: 289 [2019-11-19 23:15:29,115 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-11-19 23:15:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-19 23:15:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-11-19 23:15:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-19 23:15:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-11-19 23:15:29,132 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-11-19 23:15:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:29,133 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-11-19 23:15:29,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-11-19 23:15:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-19 23:15:29,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:29,136 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, 1, 1] [2019-11-19 23:15:29,136 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:29,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:29,137 INFO L82 PathProgramCache]: Analyzing trace with hash -575477867, now seen corresponding path program 1 times [2019-11-19 23:15:29,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:29,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3889874] [2019-11-19 23:15:29,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 23:15:29,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3889874] [2019-11-19 23:15:29,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:29,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:29,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886496034] [2019-11-19 23:15:29,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:29,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:29,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:29,196 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-11-19 23:15:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:29,408 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-11-19 23:15:29,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:29,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-19 23:15:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:29,416 INFO L225 Difference]: With dead ends: 580 [2019-11-19 23:15:29,416 INFO L226 Difference]: Without dead ends: 302 [2019-11-19 23:15:29,417 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-11-19 23:15:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-19 23:15:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-19 23:15:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-19 23:15:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-11-19 23:15:29,436 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-11-19 23:15:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:29,437 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-11-19 23:15:29,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-11-19 23:15:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-19 23:15:29,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:29,441 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, 1] [2019-11-19 23:15:29,441 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1339419474, now seen corresponding path program 1 times [2019-11-19 23:15:29,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:29,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127300616] [2019-11-19 23:15:29,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:15:29,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127300616] [2019-11-19 23:15:29,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:29,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:29,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180150883] [2019-11-19 23:15:29,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:29,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:29,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:29,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:29,563 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-11-19 23:15:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:29,821 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-11-19 23:15:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:29,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-19 23:15:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:29,825 INFO L225 Difference]: With dead ends: 597 [2019-11-19 23:15:29,825 INFO L226 Difference]: Without dead ends: 302 [2019-11-19 23:15:29,826 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-11-19 23:15:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-19 23:15:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-19 23:15:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-19 23:15:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-11-19 23:15:29,840 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-11-19 23:15:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:29,840 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-11-19 23:15:29,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-11-19 23:15:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 23:15:29,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:29,843 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, 1, 1] [2019-11-19 23:15:29,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1069928865, now seen corresponding path program 1 times [2019-11-19 23:15:29,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:29,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621933402] [2019-11-19 23:15:29,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 23:15:29,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621933402] [2019-11-19 23:15:29,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:29,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:29,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640814792] [2019-11-19 23:15:29,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:29,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:29,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:29,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:29,899 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-11-19 23:15:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:30,096 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-11-19 23:15:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:30,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-19 23:15:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:30,099 INFO L225 Difference]: With dead ends: 591 [2019-11-19 23:15:30,100 INFO L226 Difference]: Without dead ends: 300 [2019-11-19 23:15:30,101 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-11-19 23:15:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-19 23:15:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-19 23:15:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-19 23:15:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-11-19 23:15:30,115 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-11-19 23:15:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:30,116 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-11-19 23:15:30,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-11-19 23:15:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 23:15:30,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:30,118 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, 1, 1, 1] [2019-11-19 23:15:30,118 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:30,119 INFO L82 PathProgramCache]: Analyzing trace with hash 608007676, now seen corresponding path program 1 times [2019-11-19 23:15:30,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:30,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205166186] [2019-11-19 23:15:30,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-19 23:15:30,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205166186] [2019-11-19 23:15:30,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:30,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:30,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267060225] [2019-11-19 23:15:30,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:30,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:30,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:30,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:30,176 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-11-19 23:15:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:30,336 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-11-19 23:15:30,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:30,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-19 23:15:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:30,339 INFO L225 Difference]: With dead ends: 598 [2019-11-19 23:15:30,339 INFO L226 Difference]: Without dead ends: 307 [2019-11-19 23:15:30,340 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-11-19 23:15:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-19 23:15:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-11-19 23:15:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-19 23:15:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-11-19 23:15:30,355 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-11-19 23:15:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:30,356 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-11-19 23:15:30,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-11-19 23:15:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 23:15:30,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:30,358 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, 1, 1] [2019-11-19 23:15:30,359 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:30,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:30,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1349389816, now seen corresponding path program 1 times [2019-11-19 23:15:30,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:30,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668001407] [2019-11-19 23:15:30,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 23:15:30,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668001407] [2019-11-19 23:15:30,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:30,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:30,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66760795] [2019-11-19 23:15:30,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:30,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:30,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:30,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:30,446 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-11-19 23:15:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:30,656 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-11-19 23:15:30,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:30,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-19 23:15:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:30,660 INFO L225 Difference]: With dead ends: 638 [2019-11-19 23:15:30,660 INFO L226 Difference]: Without dead ends: 338 [2019-11-19 23:15:30,661 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-11-19 23:15:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-19 23:15:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-19 23:15:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-19 23:15:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-11-19 23:15:30,683 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-11-19 23:15:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:30,684 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-11-19 23:15:30,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-11-19 23:15:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 23:15:30,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:30,686 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, 1, 1] [2019-11-19 23:15:30,686 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash 206720868, now seen corresponding path program 1 times [2019-11-19 23:15:30,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:30,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141355673] [2019-11-19 23:15:30,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 23:15:30,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141355673] [2019-11-19 23:15:30,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:30,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:30,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824340179] [2019-11-19 23:15:30,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:30,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:30,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:30,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:30,739 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-11-19 23:15:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:30,934 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-11-19 23:15:30,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:30,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-19 23:15:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:30,938 INFO L225 Difference]: With dead ends: 667 [2019-11-19 23:15:30,938 INFO L226 Difference]: Without dead ends: 338 [2019-11-19 23:15:30,939 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-11-19 23:15:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-19 23:15:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-19 23:15:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-19 23:15:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-11-19 23:15:30,956 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-11-19 23:15:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:30,957 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-11-19 23:15:30,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-11-19 23:15:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 23:15:30,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:30,959 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, 1, 1] [2019-11-19 23:15:30,959 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:30,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1011601848, now seen corresponding path program 1 times [2019-11-19 23:15:30,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:30,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756368031] [2019-11-19 23:15:30,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 23:15:31,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756368031] [2019-11-19 23:15:31,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:31,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:31,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667431254] [2019-11-19 23:15:31,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:31,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:31,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:31,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:31,022 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-11-19 23:15:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:31,208 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-11-19 23:15:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:31,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-19 23:15:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:31,212 INFO L225 Difference]: With dead ends: 700 [2019-11-19 23:15:31,212 INFO L226 Difference]: Without dead ends: 371 [2019-11-19 23:15:31,213 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-11-19 23:15:31,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-19 23:15:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-19 23:15:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-19 23:15:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-11-19 23:15:31,232 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-11-19 23:15:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:31,233 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-11-19 23:15:31,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-11-19 23:15:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 23:15:31,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:31,235 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, 1, 1] [2019-11-19 23:15:31,235 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:31,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash -894235628, now seen corresponding path program 1 times [2019-11-19 23:15:31,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:31,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653728446] [2019-11-19 23:15:31,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 23:15:31,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653728446] [2019-11-19 23:15:31,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:31,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:31,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131181819] [2019-11-19 23:15:31,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:31,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:31,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:31,291 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-11-19 23:15:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:31,496 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-11-19 23:15:31,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:31,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-19 23:15:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:31,499 INFO L225 Difference]: With dead ends: 727 [2019-11-19 23:15:31,500 INFO L226 Difference]: Without dead ends: 371 [2019-11-19 23:15:31,501 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-11-19 23:15:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-19 23:15:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-19 23:15:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-19 23:15:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-11-19 23:15:31,519 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-11-19 23:15:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:31,519 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-11-19 23:15:31,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-11-19 23:15:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 23:15:31,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:31,522 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, 1] [2019-11-19 23:15:31,522 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:31,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1360340166, now seen corresponding path program 1 times [2019-11-19 23:15:31,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:31,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134137766] [2019-11-19 23:15:31,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-19 23:15:31,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134137766] [2019-11-19 23:15:31,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:31,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:31,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12325708] [2019-11-19 23:15:31,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:31,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:31,566 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-11-19 23:15:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:31,749 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-11-19 23:15:31,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:31,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-19 23:15:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:31,753 INFO L225 Difference]: With dead ends: 744 [2019-11-19 23:15:31,753 INFO L226 Difference]: Without dead ends: 388 [2019-11-19 23:15:31,754 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-11-19 23:15:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-19 23:15:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-19 23:15:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-19 23:15:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-11-19 23:15:31,773 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-11-19 23:15:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:31,773 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-11-19 23:15:31,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-11-19 23:15:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 23:15:31,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:31,778 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, 1] [2019-11-19 23:15:31,779 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:31,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:31,779 INFO L82 PathProgramCache]: Analyzing trace with hash -241831246, now seen corresponding path program 1 times [2019-11-19 23:15:31,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:31,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331460978] [2019-11-19 23:15:31,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-19 23:15:31,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331460978] [2019-11-19 23:15:31,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:31,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:31,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629832443] [2019-11-19 23:15:31,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:31,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:31,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:31,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:31,827 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-11-19 23:15:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:32,003 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-11-19 23:15:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:32,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-19 23:15:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:32,007 INFO L225 Difference]: With dead ends: 765 [2019-11-19 23:15:32,007 INFO L226 Difference]: Without dead ends: 388 [2019-11-19 23:15:32,008 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-11-19 23:15:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-19 23:15:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-19 23:15:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-19 23:15:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-11-19 23:15:32,025 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-11-19 23:15:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:32,026 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-11-19 23:15:32,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-11-19 23:15:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-19 23:15:32,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:32,028 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, 1] [2019-11-19 23:15:32,028 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1868043870, now seen corresponding path program 1 times [2019-11-19 23:15:32,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:32,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156286312] [2019-11-19 23:15:32,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:15:32,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156286312] [2019-11-19 23:15:32,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:32,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:15:32,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515739060] [2019-11-19 23:15:32,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:32,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:32,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:32,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:32,083 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-11-19 23:15:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:32,154 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-11-19 23:15:32,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:32,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-19 23:15:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:32,160 INFO L225 Difference]: With dead ends: 1092 [2019-11-19 23:15:32,161 INFO L226 Difference]: Without dead ends: 715 [2019-11-19 23:15:32,162 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-11-19 23:15:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-19 23:15:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-11-19 23:15:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-19 23:15:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-11-19 23:15:32,209 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-11-19 23:15:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:32,209 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-11-19 23:15:32,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-11-19 23:15:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-19 23:15:32,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:32,213 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, 1] [2019-11-19 23:15:32,213 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash 181343972, now seen corresponding path program 1 times [2019-11-19 23:15:32,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:32,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182484353] [2019-11-19 23:15:32,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-19 23:15:32,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182484353] [2019-11-19 23:15:32,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:32,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:15:32,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615472845] [2019-11-19 23:15:32,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:32,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:32,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:32,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:32,294 INFO L87 Difference]: Start difference. First operand 715 states and 1127 transitions. Second operand 3 states. [2019-11-19 23:15:32,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:32,370 INFO L93 Difference]: Finished difference Result 1798 states and 2838 transitions. [2019-11-19 23:15:32,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:32,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-19 23:15:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:32,378 INFO L225 Difference]: With dead ends: 1798 [2019-11-19 23:15:32,378 INFO L226 Difference]: Without dead ends: 1090 [2019-11-19 23:15:32,380 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-11-19 23:15:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-11-19 23:15:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2019-11-19 23:15:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-11-19 23:15:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1720 transitions. [2019-11-19 23:15:32,432 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1720 transitions. Word has length 121 [2019-11-19 23:15:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:32,432 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1720 transitions. [2019-11-19 23:15:32,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1720 transitions. [2019-11-19 23:15:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-19 23:15:32,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:32,436 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, 1] [2019-11-19 23:15:32,436 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -956252537, now seen corresponding path program 1 times [2019-11-19 23:15:32,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:32,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621286830] [2019-11-19 23:15:32,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-19 23:15:32,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621286830] [2019-11-19 23:15:32,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:32,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:32,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217728514] [2019-11-19 23:15:32,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:32,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:32,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:32,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:32,492 INFO L87 Difference]: Start difference. First operand 1090 states and 1720 transitions. Second operand 3 states. [2019-11-19 23:15:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:32,771 INFO L93 Difference]: Finished difference Result 2299 states and 3632 transitions. [2019-11-19 23:15:32,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:32,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-19 23:15:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:32,780 INFO L225 Difference]: With dead ends: 2299 [2019-11-19 23:15:32,780 INFO L226 Difference]: Without dead ends: 1216 [2019-11-19 23:15:32,782 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-11-19 23:15:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-11-19 23:15:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1204. [2019-11-19 23:15:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-11-19 23:15:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1898 transitions. [2019-11-19 23:15:32,861 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1898 transitions. Word has length 122 [2019-11-19 23:15:32,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:32,861 INFO L462 AbstractCegarLoop]: Abstraction has 1204 states and 1898 transitions. [2019-11-19 23:15:32,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1898 transitions. [2019-11-19 23:15:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 23:15:32,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:32,866 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, 1] [2019-11-19 23:15:32,866 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:32,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1998579872, now seen corresponding path program 1 times [2019-11-19 23:15:32,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:32,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271276008] [2019-11-19 23:15:32,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-19 23:15:32,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271276008] [2019-11-19 23:15:32,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:32,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:32,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045223540] [2019-11-19 23:15:32,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:32,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:32,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:32,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:32,918 INFO L87 Difference]: Start difference. First operand 1204 states and 1898 transitions. Second operand 3 states. [2019-11-19 23:15:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:33,163 INFO L93 Difference]: Finished difference Result 2413 states and 3802 transitions. [2019-11-19 23:15:33,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:33,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-19 23:15:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:33,173 INFO L225 Difference]: With dead ends: 2413 [2019-11-19 23:15:33,173 INFO L226 Difference]: Without dead ends: 1210 [2019-11-19 23:15:33,175 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-11-19 23:15:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-19 23:15:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1198. [2019-11-19 23:15:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-11-19 23:15:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1881 transitions. [2019-11-19 23:15:33,230 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1881 transitions. Word has length 123 [2019-11-19 23:15:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:33,231 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1881 transitions. [2019-11-19 23:15:33,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1881 transitions. [2019-11-19 23:15:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-19 23:15:33,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:33,236 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, 1] [2019-11-19 23:15:33,236 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:33,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 496982003, now seen corresponding path program 1 times [2019-11-19 23:15:33,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:33,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81381345] [2019-11-19 23:15:33,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-19 23:15:33,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81381345] [2019-11-19 23:15:33,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:33,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:33,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362465397] [2019-11-19 23:15:33,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:33,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:33,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:33,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:33,292 INFO L87 Difference]: Start difference. First operand 1198 states and 1881 transitions. Second operand 3 states. [2019-11-19 23:15:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:33,536 INFO L93 Difference]: Finished difference Result 2503 states and 3931 transitions. [2019-11-19 23:15:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:33,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-19 23:15:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:33,547 INFO L225 Difference]: With dead ends: 2503 [2019-11-19 23:15:33,547 INFO L226 Difference]: Without dead ends: 1312 [2019-11-19 23:15:33,549 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-11-19 23:15:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-11-19 23:15:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2019-11-19 23:15:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-11-19 23:15:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2044 transitions. [2019-11-19 23:15:33,607 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2044 transitions. Word has length 155 [2019-11-19 23:15:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:33,607 INFO L462 AbstractCegarLoop]: Abstraction has 1306 states and 2044 transitions. [2019-11-19 23:15:33,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2044 transitions. [2019-11-19 23:15:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-19 23:15:33,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:33,613 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, 1] [2019-11-19 23:15:33,613 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1762620122, now seen corresponding path program 1 times [2019-11-19 23:15:33,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:33,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117450634] [2019-11-19 23:15:33,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-19 23:15:33,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117450634] [2019-11-19 23:15:33,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:33,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:33,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091143121] [2019-11-19 23:15:33,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:33,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:33,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:33,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:33,669 INFO L87 Difference]: Start difference. First operand 1306 states and 2044 transitions. Second operand 3 states. [2019-11-19 23:15:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:33,930 INFO L93 Difference]: Finished difference Result 2611 states and 4083 transitions. [2019-11-19 23:15:33,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:33,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-19 23:15:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:33,940 INFO L225 Difference]: With dead ends: 2611 [2019-11-19 23:15:33,940 INFO L226 Difference]: Without dead ends: 1306 [2019-11-19 23:15:33,942 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-11-19 23:15:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-11-19 23:15:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1300. [2019-11-19 23:15:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-11-19 23:15:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2024 transitions. [2019-11-19 23:15:33,999 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2024 transitions. Word has length 156 [2019-11-19 23:15:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:33,999 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 2024 transitions. [2019-11-19 23:15:33,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2024 transitions. [2019-11-19 23:15:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-19 23:15:34,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:34,005 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, 1] [2019-11-19 23:15:34,005 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:34,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1655718978, now seen corresponding path program 1 times [2019-11-19 23:15:34,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:34,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585905688] [2019-11-19 23:15:34,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-19 23:15:34,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585905688] [2019-11-19 23:15:34,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:34,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:34,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528933383] [2019-11-19 23:15:34,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:34,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:34,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:34,075 INFO L87 Difference]: Start difference. First operand 1300 states and 2024 transitions. Second operand 3 states. [2019-11-19 23:15:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:34,314 INFO L93 Difference]: Finished difference Result 2701 states and 4205 transitions. [2019-11-19 23:15:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:34,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-19 23:15:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:34,324 INFO L225 Difference]: With dead ends: 2701 [2019-11-19 23:15:34,325 INFO L226 Difference]: Without dead ends: 1408 [2019-11-19 23:15:34,327 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-11-19 23:15:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-11-19 23:15:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1402. [2019-11-19 23:15:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-11-19 23:15:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2172 transitions. [2019-11-19 23:15:34,385 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2172 transitions. Word has length 186 [2019-11-19 23:15:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:34,386 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 2172 transitions. [2019-11-19 23:15:34,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2172 transitions. [2019-11-19 23:15:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-19 23:15:34,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:34,391 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, 1] [2019-11-19 23:15:34,391 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:34,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1614779429, now seen corresponding path program 1 times [2019-11-19 23:15:34,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:34,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540022403] [2019-11-19 23:15:34,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-19 23:15:34,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540022403] [2019-11-19 23:15:34,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:34,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:34,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575162976] [2019-11-19 23:15:34,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:34,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:34,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:34,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:34,455 INFO L87 Difference]: Start difference. First operand 1402 states and 2172 transitions. Second operand 3 states. [2019-11-19 23:15:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:34,704 INFO L93 Difference]: Finished difference Result 2803 states and 4339 transitions. [2019-11-19 23:15:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:34,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-19 23:15:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:34,713 INFO L225 Difference]: With dead ends: 2803 [2019-11-19 23:15:34,713 INFO L226 Difference]: Without dead ends: 1402 [2019-11-19 23:15:34,716 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-11-19 23:15:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-11-19 23:15:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1396. [2019-11-19 23:15:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-11-19 23:15:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2149 transitions. [2019-11-19 23:15:34,774 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2149 transitions. Word has length 187 [2019-11-19 23:15:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:34,774 INFO L462 AbstractCegarLoop]: Abstraction has 1396 states and 2149 transitions. [2019-11-19 23:15:34,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2149 transitions. [2019-11-19 23:15:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-19 23:15:34,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:34,780 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, 1, 1] [2019-11-19 23:15:34,780 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash -848280398, now seen corresponding path program 1 times [2019-11-19 23:15:34,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:34,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338952926] [2019-11-19 23:15:34,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-19 23:15:34,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338952926] [2019-11-19 23:15:34,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:34,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:34,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306094780] [2019-11-19 23:15:34,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:34,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:34,861 INFO L87 Difference]: Start difference. First operand 1396 states and 2149 transitions. Second operand 3 states. [2019-11-19 23:15:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:35,066 INFO L93 Difference]: Finished difference Result 2899 states and 4473 transitions. [2019-11-19 23:15:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:35,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-19 23:15:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:35,076 INFO L225 Difference]: With dead ends: 2899 [2019-11-19 23:15:35,076 INFO L226 Difference]: Without dead ends: 1510 [2019-11-19 23:15:35,079 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-11-19 23:15:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-11-19 23:15:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-11-19 23:15:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-19 23:15:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2246 transitions. [2019-11-19 23:15:35,139 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2246 transitions. Word has length 205 [2019-11-19 23:15:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:35,140 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2246 transitions. [2019-11-19 23:15:35,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2246 transitions. [2019-11-19 23:15:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-19 23:15:35,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:35,145 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, 1, 1] [2019-11-19 23:15:35,146 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:35,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1187572258, now seen corresponding path program 1 times [2019-11-19 23:15:35,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:35,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943646690] [2019-11-19 23:15:35,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-19 23:15:35,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943646690] [2019-11-19 23:15:35,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:35,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:35,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245642271] [2019-11-19 23:15:35,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:35,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:35,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:35,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:35,213 INFO L87 Difference]: Start difference. First operand 1471 states and 2246 transitions. Second operand 3 states. [2019-11-19 23:15:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:35,412 INFO L93 Difference]: Finished difference Result 2974 states and 4544 transitions. [2019-11-19 23:15:35,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:35,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-11-19 23:15:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:35,422 INFO L225 Difference]: With dead ends: 2974 [2019-11-19 23:15:35,423 INFO L226 Difference]: Without dead ends: 1510 [2019-11-19 23:15:35,427 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-11-19 23:15:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-11-19 23:15:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-11-19 23:15:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-19 23:15:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2220 transitions. [2019-11-19 23:15:35,492 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2220 transitions. Word has length 206 [2019-11-19 23:15:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:35,492 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2220 transitions. [2019-11-19 23:15:35,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2220 transitions. [2019-11-19 23:15:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-19 23:15:35,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:35,498 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, 1] [2019-11-19 23:15:35,499 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash -778811277, now seen corresponding path program 1 times [2019-11-19 23:15:35,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:35,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272029396] [2019-11-19 23:15:35,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-19 23:15:35,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272029396] [2019-11-19 23:15:35,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:35,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:35,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709706133] [2019-11-19 23:15:35,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:35,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:35,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:35,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:35,581 INFO L87 Difference]: Start difference. First operand 1471 states and 2220 transitions. Second operand 3 states. [2019-11-19 23:15:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:35,808 INFO L93 Difference]: Finished difference Result 2947 states and 4444 transitions. [2019-11-19 23:15:35,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:35,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-19 23:15:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:35,819 INFO L225 Difference]: With dead ends: 2947 [2019-11-19 23:15:35,819 INFO L226 Difference]: Without dead ends: 1483 [2019-11-19 23:15:35,822 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-11-19 23:15:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2019-11-19 23:15:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2019-11-19 23:15:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-11-19 23:15:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2019-11-19 23:15:35,883 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 217 [2019-11-19 23:15:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:35,883 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2019-11-19 23:15:35,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2019-11-19 23:15:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-19 23:15:35,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:35,890 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, 1] [2019-11-19 23:15:35,890 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:35,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1333590618, now seen corresponding path program 1 times [2019-11-19 23:15:35,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:35,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927772860] [2019-11-19 23:15:35,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-19 23:15:35,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927772860] [2019-11-19 23:15:35,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:35,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:35,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600740880] [2019-11-19 23:15:35,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:35,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:35,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:35,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:35,983 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand 3 states. [2019-11-19 23:15:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:36,233 INFO L93 Difference]: Finished difference Result 2947 states and 4410 transitions. [2019-11-19 23:15:36,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:36,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-19 23:15:36,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:36,244 INFO L225 Difference]: With dead ends: 2947 [2019-11-19 23:15:36,245 INFO L226 Difference]: Without dead ends: 1456 [2019-11-19 23:15:36,247 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-11-19 23:15:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-11-19 23:15:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1444. [2019-11-19 23:15:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-11-19 23:15:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2147 transitions. [2019-11-19 23:15:36,318 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2147 transitions. Word has length 218 [2019-11-19 23:15:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:36,319 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 2147 transitions. [2019-11-19 23:15:36,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2147 transitions. [2019-11-19 23:15:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-19 23:15:36,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:36,326 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, 1, 1] [2019-11-19 23:15:36,327 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash 193493261, now seen corresponding path program 1 times [2019-11-19 23:15:36,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:36,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621746094] [2019-11-19 23:15:36,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-19 23:15:36,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621746094] [2019-11-19 23:15:36,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:36,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:36,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974839992] [2019-11-19 23:15:36,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:36,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:36,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:36,453 INFO L87 Difference]: Start difference. First operand 1444 states and 2147 transitions. Second operand 3 states. [2019-11-19 23:15:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:36,738 INFO L93 Difference]: Finished difference Result 2962 states and 4409 transitions. [2019-11-19 23:15:36,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:36,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-19 23:15:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:36,748 INFO L225 Difference]: With dead ends: 2962 [2019-11-19 23:15:36,748 INFO L226 Difference]: Without dead ends: 1525 [2019-11-19 23:15:36,753 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-11-19 23:15:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2019-11-19 23:15:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1513. [2019-11-19 23:15:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-11-19 23:15:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2229 transitions. [2019-11-19 23:15:36,815 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2229 transitions. Word has length 226 [2019-11-19 23:15:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:36,815 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 2229 transitions. [2019-11-19 23:15:36,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2229 transitions. [2019-11-19 23:15:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-19 23:15:36,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:36,822 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, 1, 1] [2019-11-19 23:15:36,822 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:36,822 INFO L82 PathProgramCache]: Analyzing trace with hash -831258623, now seen corresponding path program 1 times [2019-11-19 23:15:36,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:36,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860524835] [2019-11-19 23:15:36,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-19 23:15:36,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860524835] [2019-11-19 23:15:36,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:36,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:36,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753146103] [2019-11-19 23:15:36,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:36,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:36,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:36,905 INFO L87 Difference]: Start difference. First operand 1513 states and 2229 transitions. Second operand 3 states. [2019-11-19 23:15:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:37,121 INFO L93 Difference]: Finished difference Result 3031 states and 4462 transitions. [2019-11-19 23:15:37,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:37,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-19 23:15:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:37,132 INFO L225 Difference]: With dead ends: 3031 [2019-11-19 23:15:37,132 INFO L226 Difference]: Without dead ends: 1513 [2019-11-19 23:15:37,135 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-11-19 23:15:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-11-19 23:15:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1501. [2019-11-19 23:15:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-11-19 23:15:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2182 transitions. [2019-11-19 23:15:37,197 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2182 transitions. Word has length 227 [2019-11-19 23:15:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:37,197 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 2182 transitions. [2019-11-19 23:15:37,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2182 transitions. [2019-11-19 23:15:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-19 23:15:37,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:37,204 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, 1, 1] [2019-11-19 23:15:37,205 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash 225623806, now seen corresponding path program 1 times [2019-11-19 23:15:37,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:37,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126975866] [2019-11-19 23:15:37,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-11-19 23:15:37,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126975866] [2019-11-19 23:15:37,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:37,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:15:37,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622172205] [2019-11-19 23:15:37,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:37,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:37,302 INFO L87 Difference]: Start difference. First operand 1501 states and 2182 transitions. Second operand 3 states. [2019-11-19 23:15:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:37,378 INFO L93 Difference]: Finished difference Result 3052 states and 4439 transitions. [2019-11-19 23:15:37,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:37,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-19 23:15:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:37,400 INFO L225 Difference]: With dead ends: 3052 [2019-11-19 23:15:37,406 INFO L226 Difference]: Without dead ends: 1558 [2019-11-19 23:15:37,409 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-11-19 23:15:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-11-19 23:15:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2019-11-19 23:15:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-11-19 23:15:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2266 transitions. [2019-11-19 23:15:37,472 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2266 transitions. Word has length 263 [2019-11-19 23:15:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:37,473 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2266 transitions. [2019-11-19 23:15:37,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2266 transitions. [2019-11-19 23:15:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-19 23:15:37,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:37,479 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, 1, 1] [2019-11-19 23:15:37,480 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:37,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1710298052, now seen corresponding path program 1 times [2019-11-19 23:15:37,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:37,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28628612] [2019-11-19 23:15:37,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2019-11-19 23:15:37,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28628612] [2019-11-19 23:15:37,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:37,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:15:37,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853340899] [2019-11-19 23:15:37,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:37,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:37,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:37,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:37,570 INFO L87 Difference]: Start difference. First operand 1558 states and 2266 transitions. Second operand 3 states. [2019-11-19 23:15:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:37,657 INFO L93 Difference]: Finished difference Result 3142 states and 4569 transitions. [2019-11-19 23:15:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:37,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-19 23:15:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:37,662 INFO L225 Difference]: With dead ends: 3142 [2019-11-19 23:15:37,662 INFO L226 Difference]: Without dead ends: 1591 [2019-11-19 23:15:37,665 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-11-19 23:15:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-11-19 23:15:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2019-11-19 23:15:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-11-19 23:15:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2313 transitions. [2019-11-19 23:15:37,731 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2313 transitions. Word has length 263 [2019-11-19 23:15:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:37,732 INFO L462 AbstractCegarLoop]: Abstraction has 1591 states and 2313 transitions. [2019-11-19 23:15:37,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2313 transitions. [2019-11-19 23:15:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-19 23:15:37,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:37,739 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, 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] [2019-11-19 23:15:37,740 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:37,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1900040589, now seen corresponding path program 1 times [2019-11-19 23:15:37,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:37,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666793198] [2019-11-19 23:15:37,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-19 23:15:37,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666793198] [2019-11-19 23:15:37,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:37,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:15:37,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898778540] [2019-11-19 23:15:37,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:37,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:37,897 INFO L87 Difference]: Start difference. First operand 1591 states and 2313 transitions. Second operand 3 states. [2019-11-19 23:15:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:38,011 INFO L93 Difference]: Finished difference Result 4612 states and 6703 transitions. [2019-11-19 23:15:38,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:38,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-11-19 23:15:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:38,050 INFO L225 Difference]: With dead ends: 4612 [2019-11-19 23:15:38,050 INFO L226 Difference]: Without dead ends: 3061 [2019-11-19 23:15:38,053 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-11-19 23:15:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-11-19 23:15:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3059. [2019-11-19 23:15:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2019-11-19 23:15:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4438 transitions. [2019-11-19 23:15:38,186 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4438 transitions. Word has length 271 [2019-11-19 23:15:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:38,187 INFO L462 AbstractCegarLoop]: Abstraction has 3059 states and 4438 transitions. [2019-11-19 23:15:38,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4438 transitions. [2019-11-19 23:15:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-19 23:15:38,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:38,197 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, 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-11-19 23:15:38,197 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:38,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash 999895398, now seen corresponding path program 1 times [2019-11-19 23:15:38,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:38,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714977439] [2019-11-19 23:15:38,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-19 23:15:38,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714977439] [2019-11-19 23:15:38,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:38,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:15:38,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639733243] [2019-11-19 23:15:38,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:38,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:38,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:38,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:38,328 INFO L87 Difference]: Start difference. First operand 3059 states and 4438 transitions. Second operand 3 states. [2019-11-19 23:15:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:38,587 INFO L93 Difference]: Finished difference Result 6291 states and 9153 transitions. [2019-11-19 23:15:38,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:38,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-11-19 23:15:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:38,593 INFO L225 Difference]: With dead ends: 6291 [2019-11-19 23:15:38,593 INFO L226 Difference]: Without dead ends: 2043 [2019-11-19 23:15:38,600 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-11-19 23:15:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-11-19 23:15:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2023. [2019-11-19 23:15:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-11-19 23:15:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2884 transitions. [2019-11-19 23:15:38,677 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2884 transitions. Word has length 308 [2019-11-19 23:15:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:38,677 INFO L462 AbstractCegarLoop]: Abstraction has 2023 states and 2884 transitions. [2019-11-19 23:15:38,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2884 transitions. [2019-11-19 23:15:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-19 23:15:38,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:38,687 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, 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-11-19 23:15:38,687 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:38,687 INFO L82 PathProgramCache]: Analyzing trace with hash -531219143, now seen corresponding path program 1 times [2019-11-19 23:15:38,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:38,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612325353] [2019-11-19 23:15:38,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-11-19 23:15:38,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612325353] [2019-11-19 23:15:38,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226082313] [2019-11-19 23:15:38,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/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-11-19 23:15:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:39,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:15:39,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:15:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-11-19 23:15:39,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:15:39,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:15:39,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62450243] [2019-11-19 23:15:39,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:39,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:39,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:39,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:15:39,271 INFO L87 Difference]: Start difference. First operand 2023 states and 2884 transitions. Second operand 3 states. [2019-11-19 23:15:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:39,431 INFO L93 Difference]: Finished difference Result 4660 states and 6632 transitions. [2019-11-19 23:15:39,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:39,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-11-19 23:15:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:39,439 INFO L225 Difference]: With dead ends: 4660 [2019-11-19 23:15:39,439 INFO L226 Difference]: Without dead ends: 2676 [2019-11-19 23:15:39,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 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-11-19 23:15:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-11-19 23:15:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2676. [2019-11-19 23:15:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2019-11-19 23:15:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3798 transitions. [2019-11-19 23:15:39,571 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3798 transitions. Word has length 375 [2019-11-19 23:15:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:39,573 INFO L462 AbstractCegarLoop]: Abstraction has 2676 states and 3798 transitions. [2019-11-19 23:15:39,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3798 transitions. [2019-11-19 23:15:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-11-19 23:15:39,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:39,589 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:15:39,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:15:39,795 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash 490258226, now seen corresponding path program 1 times [2019-11-19 23:15:39,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:39,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777603260] [2019-11-19 23:15:39,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-19 23:15:40,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777603260] [2019-11-19 23:15:40,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330087761] [2019-11-19 23:15:40,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/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-11-19 23:15:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:40,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:15:40,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:15:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-11-19 23:15:40,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:15:40,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:15:40,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843407091] [2019-11-19 23:15:40,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:40,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:15:40,524 INFO L87 Difference]: Start difference. First operand 2676 states and 3798 transitions. Second operand 3 states. [2019-11-19 23:15:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:40,592 INFO L93 Difference]: Finished difference Result 2736 states and 3882 transitions. [2019-11-19 23:15:40,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:40,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-11-19 23:15:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:40,597 INFO L225 Difference]: With dead ends: 2736 [2019-11-19 23:15:40,598 INFO L226 Difference]: Without dead ends: 2143 [2019-11-19 23:15:40,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 446 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-11-19 23:15:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2019-11-19 23:15:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2085. [2019-11-19 23:15:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2019-11-19 23:15:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2968 transitions. [2019-11-19 23:15:40,672 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2968 transitions. Word has length 446 [2019-11-19 23:15:40,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:40,673 INFO L462 AbstractCegarLoop]: Abstraction has 2085 states and 2968 transitions. [2019-11-19 23:15:40,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2968 transitions. [2019-11-19 23:15:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-11-19 23:15:40,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:40,685 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:15:40,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:15:40,890 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 567159024, now seen corresponding path program 1 times [2019-11-19 23:15:40,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:40,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025068554] [2019-11-19 23:15:40,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-19 23:15:41,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025068554] [2019-11-19 23:15:41,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182221343] [2019-11-19 23:15:41,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/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-11-19 23:15:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:41,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:15:41,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:15:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-19 23:15:41,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:15:41,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 23:15:41,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801272001] [2019-11-19 23:15:41,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:15:41,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:41,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:15:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:15:41,469 INFO L87 Difference]: Start difference. First operand 2085 states and 2968 transitions. Second operand 4 states. [2019-11-19 23:15:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:41,850 INFO L93 Difference]: Finished difference Result 4343 states and 6173 transitions. [2019-11-19 23:15:41,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:15:41,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 446 [2019-11-19 23:15:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:41,856 INFO L225 Difference]: With dead ends: 4343 [2019-11-19 23:15:41,856 INFO L226 Difference]: Without dead ends: 2221 [2019-11-19 23:15:41,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 448 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-11-19 23:15:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-11-19 23:15:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1935. [2019-11-19 23:15:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-19 23:15:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-11-19 23:15:41,955 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 446 [2019-11-19 23:15:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:41,956 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-11-19 23:15:41,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:15:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-11-19 23:15:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-11-19 23:15:41,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:41,969 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:15:42,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:15:42,175 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:42,176 INFO L82 PathProgramCache]: Analyzing trace with hash 260585257, now seen corresponding path program 1 times [2019-11-19 23:15:42,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:42,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830849906] [2019-11-19 23:15:42,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-19 23:15:42,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830849906] [2019-11-19 23:15:42,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651159549] [2019-11-19 23:15:42,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:15:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:43,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:15:43,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:15:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-11-19 23:15:43,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:15:43,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 23:15:43,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075003701] [2019-11-19 23:15:43,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:15:43,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:43,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:15:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:15:43,798 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 4 states. [2019-11-19 23:15:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:44,175 INFO L93 Difference]: Finished difference Result 4591 states and 6320 transitions. [2019-11-19 23:15:44,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:15:44,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 847 [2019-11-19 23:15:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:44,182 INFO L225 Difference]: With dead ends: 4591 [2019-11-19 23:15:44,183 INFO L226 Difference]: Without dead ends: 2601 [2019-11-19 23:15:44,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 849 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-11-19 23:15:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2019-11-19 23:15:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1935. [2019-11-19 23:15:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-19 23:15:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-11-19 23:15:44,269 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 847 [2019-11-19 23:15:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:44,270 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-11-19 23:15:44,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:15:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-11-19 23:15:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2019-11-19 23:15:44,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:44,284 INFO L410 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:15:44,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:15:44,488 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:44,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1537607748, now seen corresponding path program 1 times [2019-11-19 23:15:44,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:44,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334278835] [2019-11-19 23:15:44,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-11-19 23:15:45,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334278835] [2019-11-19 23:15:45,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:45,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:15:45,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185309252] [2019-11-19 23:15:45,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:45,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:45,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:45,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:45,501 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 3 states. [2019-11-19 23:15:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:45,766 INFO L93 Difference]: Finished difference Result 3871 states and 5290 transitions. [2019-11-19 23:15:45,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:45,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1028 [2019-11-19 23:15:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:45,772 INFO L225 Difference]: With dead ends: 3871 [2019-11-19 23:15:45,773 INFO L226 Difference]: Without dead ends: 1975 [2019-11-19 23:15:45,775 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-11-19 23:15:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2019-11-19 23:15:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1935. [2019-11-19 23:15:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-19 23:15:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2633 transitions. [2019-11-19 23:15:45,864 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2633 transitions. Word has length 1028 [2019-11-19 23:15:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:45,866 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2633 transitions. [2019-11-19 23:15:45,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2633 transitions. [2019-11-19 23:15:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-11-19 23:15:45,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:45,880 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:15:45,880 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:45,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1152424720, now seen corresponding path program 1 times [2019-11-19 23:15:45,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:45,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819947693] [2019-11-19 23:15:45,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-11-19 23:15:46,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819947693] [2019-11-19 23:15:46,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:46,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:15:46,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410071327] [2019-11-19 23:15:46,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:46,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:46,786 INFO L87 Difference]: Start difference. First operand 1935 states and 2633 transitions. Second operand 3 states. [2019-11-19 23:15:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:47,008 INFO L93 Difference]: Finished difference Result 3831 states and 5212 transitions. [2019-11-19 23:15:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:47,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1043 [2019-11-19 23:15:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:47,014 INFO L225 Difference]: With dead ends: 3831 [2019-11-19 23:15:47,014 INFO L226 Difference]: Without dead ends: 1935 [2019-11-19 23:15:47,019 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-11-19 23:15:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-11-19 23:15:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-11-19 23:15:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-19 23:15:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2595 transitions. [2019-11-19 23:15:47,093 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2595 transitions. Word has length 1043 [2019-11-19 23:15:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:47,094 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2595 transitions. [2019-11-19 23:15:47,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2595 transitions. [2019-11-19 23:15:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2019-11-19 23:15:47,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:47,108 INFO L410 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:15:47,109 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:47,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:47,109 INFO L82 PathProgramCache]: Analyzing trace with hash -529516007, now seen corresponding path program 1 times [2019-11-19 23:15:47,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:47,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551026115] [2019-11-19 23:15:47,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-11-19 23:15:48,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551026115] [2019-11-19 23:15:48,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:48,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:15:48,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257711325] [2019-11-19 23:15:48,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:48,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:48,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:48,039 INFO L87 Difference]: Start difference. First operand 1935 states and 2595 transitions. Second operand 3 states. [2019-11-19 23:15:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:48,262 INFO L93 Difference]: Finished difference Result 3871 states and 5194 transitions. [2019-11-19 23:15:48,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:48,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1071 [2019-11-19 23:15:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:48,268 INFO L225 Difference]: With dead ends: 3871 [2019-11-19 23:15:48,268 INFO L226 Difference]: Without dead ends: 1963 [2019-11-19 23:15:48,271 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-11-19 23:15:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-11-19 23:15:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2019-11-19 23:15:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-11-19 23:15:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2623 transitions. [2019-11-19 23:15:48,345 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2623 transitions. Word has length 1071 [2019-11-19 23:15:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:48,347 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 2623 transitions. [2019-11-19 23:15:48,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2623 transitions. [2019-11-19 23:15:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-11-19 23:15:48,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:48,362 INFO L410 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 23:15:48,362 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:15:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash -503398519, now seen corresponding path program 1 times [2019-11-19 23:15:48,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:15:48,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950582663] [2019-11-19 23:15:48,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:15:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-11-19 23:15:49,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950582663] [2019-11-19 23:15:49,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:15:49,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:15:49,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140453053] [2019-11-19 23:15:49,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:15:49,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:15:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:15:49,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:15:49,322 INFO L87 Difference]: Start difference. First operand 1963 states and 2623 transitions. Second operand 3 states. [2019-11-19 23:15:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:49,496 INFO L93 Difference]: Finished difference Result 2491 states and 3323 transitions. [2019-11-19 23:15:49,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:15:49,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-11-19 23:15:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:49,498 INFO L225 Difference]: With dead ends: 2491 [2019-11-19 23:15:49,498 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:15:49,501 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-11-19 23:15:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:15:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:15:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:15:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:15:49,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1103 [2019-11-19 23:15:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:49,502 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:15:49,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:15:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:15:49,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:15:49,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:15:50,181 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 130 [2019-11-19 23:15:50,607 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 128 [2019-11-19 23:15:51,475 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-19 23:15:52,015 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-19 23:15:52,577 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-11-19 23:15:52,855 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-19 23:15:53,178 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-19 23:15:53,669 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-11-19 23:15:54,634 WARN L191 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 90 [2019-11-19 23:15:54,952 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-19 23:15:55,277 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-19 23:15:55,629 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-19 23:15:56,044 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-19 23:15:56,419 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-19 23:15:56,828 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-19 23:15:57,110 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-19 23:15:57,949 WARN L191 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 85 [2019-11-19 23:15:58,408 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-19 23:15:58,812 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-19 23:15:59,172 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-11-19 23:15:59,495 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-19 23:15:59,869 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-19 23:16:00,494 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-11-19 23:16:00,497 INFO L447 ceAbstractionStarter]: At program point L630(lines 621 632) the Hoare annotation is: true [2019-11-19 23:16:00,497 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed. [2019-11-19 23:16:00,497 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 237) no Hoare annotation was computed. [2019-11-19 23:16:00,497 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 551) 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 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-11-19 23:16:00,498 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 583) 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-11-19 23:16:00,498 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 308) no Hoare annotation was computed. [2019-11-19 23:16:00,498 INFO L444 ceAbstractionStarter]: For program point L301-2(lines 301 308) no Hoare annotation was computed. [2019-11-19 23:16:00,498 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 549) no Hoare annotation was computed. [2019-11-19 23:16:00,498 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 560) no Hoare annotation was computed. [2019-11-19 23:16:00,499 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 571) no Hoare annotation was computed. [2019-11-19 23:16:00,499 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 582) no Hoare annotation was computed. [2019-11-19 23:16:00,499 INFO L444 ceAbstractionStarter]: For program point L534(lines 534 540) no Hoare annotation was computed. [2019-11-19 23:16:00,499 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 534 540) no Hoare annotation was computed. [2019-11-19 23:16:00,499 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 360) no Hoare annotation was computed. [2019-11-19 23:16:00,499 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 549) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-19 23:16:00,500 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 561) 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 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 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.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 .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-19 23:16:00,500 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 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))) (.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))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse7 .cse8 (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)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse9 .cse10 .cse12 .cse11) .cse13) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse12 .cse11) .cse13))) [2019-11-19 23:16:00,500 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 273) no Hoare annotation was computed. [2019-11-19 23:16:00,500 INFO L444 ceAbstractionStarter]: For program point L271-2(lines 207 546) no Hoare annotation was computed. [2019-11-19 23:16:00,501 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2019-11-19 23:16:00,502 INFO L444 ceAbstractionStarter]: For program point L239(lines 239 250) no Hoare annotation was computed. [2019-11-19 23:16:00,502 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 549) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-19 23:16:00,502 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 559) no Hoare annotation was computed. [2019-11-19 23:16:00,502 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 570) no Hoare annotation was computed. [2019-11-19 23:16:00,502 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 581) no Hoare annotation was computed. [2019-11-19 23:16:00,503 INFO L447 ceAbstractionStarter]: At program point L603(lines 97 604) the Hoare annotation is: true [2019-11-19 23:16:00,503 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2019-11-19 23:16:00,503 INFO L444 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2019-11-19 23:16:00,503 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 441) no Hoare annotation was computed. [2019-11-19 23:16:00,503 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 344) no Hoare annotation was computed. [2019-11-19 23:16:00,504 INFO L444 ceAbstractionStarter]: For program point L340-2(lines 340 344) no Hoare annotation was computed. [2019-11-19 23:16:00,504 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 244) no Hoare annotation was computed. [2019-11-19 23:16:00,504 INFO L444 ceAbstractionStarter]: For program point L374(lines 374 406) no Hoare annotation was computed. [2019-11-19 23:16:00,504 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 558) no Hoare annotation was computed. [2019-11-19 23:16:00,504 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 569) no Hoare annotation was computed. [2019-11-19 23:16:00,504 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 580) no Hoare annotation was computed. [2019-11-19 23:16:00,505 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2019-11-19 23:16:00,505 INFO L444 ceAbstractionStarter]: For program point L474-2(lines 207 546) no Hoare annotation was computed. [2019-11-19 23:16:00,505 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 381) no Hoare annotation was computed. [2019-11-19 23:16:00,505 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 582) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and .cse0 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0))) (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))))) [2019-11-19 23:16:00,506 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 559) 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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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-11-19 23:16:00,506 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 570) 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))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 23:16:00,507 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 451) no Hoare annotation was computed. [2019-11-19 23:16:00,507 INFO L444 ceAbstractionStarter]: For program point L608(lines 608 610) no Hoare annotation was computed. [2019-11-19 23:16:00,507 INFO L444 ceAbstractionStarter]: For program point L608-2(lines 608 610) no Hoare annotation was computed. [2019-11-19 23:16:00,507 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 557) no Hoare annotation was computed. [2019-11-19 23:16:00,507 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 568) no Hoare annotation was computed. [2019-11-19 23:16:00,508 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 579) no Hoare annotation was computed. [2019-11-19 23:16:00,508 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-19 23:16:00,508 INFO L447 ceAbstractionStarter]: At program point L611(lines 11 615) the Hoare annotation is: true [2019-11-19 23:16:00,508 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-19 23:16:00,508 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-19 23:16:00,508 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 556) no Hoare annotation was computed. [2019-11-19 23:16:00,509 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 567) no Hoare annotation was computed. [2019-11-19 23:16:00,509 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-19 23:16:00,509 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 578) no Hoare annotation was computed. [2019-11-19 23:16:00,509 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 519) no Hoare annotation was computed. [2019-11-19 23:16:00,509 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 484) no Hoare annotation was computed. [2019-11-19 23:16:00,510 INFO L444 ceAbstractionStarter]: For program point L480-2(lines 480 484) no Hoare annotation was computed. [2019-11-19 23:16:00,510 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 356) no Hoare annotation was computed. [2019-11-19 23:16:00,510 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 557) 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))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (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 .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .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 .cse9 .cse8 (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-11-19 23:16:00,511 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 568) 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))) (.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 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (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)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 23:16:00,511 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-19 23:16:00,511 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-19 23:16:00,512 INFO L440 ceAbstractionStarter]: At program point L547(lines 98 602) the Hoare annotation is: (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (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))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse13 .cse14) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse13 (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)) .cse14 .cse8) (and (and .cse1 (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)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse9 .cse10 .cse11) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (and .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 23:16:00,512 INFO L440 ceAbstractionStarter]: At program point L349(lines 324 367) 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))) (.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 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (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)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 23:16:00,512 INFO L444 ceAbstractionStarter]: For program point L416(lines 416 418) no Hoare annotation was computed. [2019-11-19 23:16:00,513 INFO L440 ceAbstractionStarter]: At program point L383(lines 374 406) 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))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (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)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 23:16:00,513 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:16:00,513 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 286) no Hoare annotation was computed. [2019-11-19 23:16:00,513 INFO L444 ceAbstractionStarter]: For program point L284-2(lines 207 546) no Hoare annotation was computed. [2019-11-19 23:16:00,514 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 555) no Hoare annotation was computed. [2019-11-19 23:16:00,514 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 566) no Hoare annotation was computed. [2019-11-19 23:16:00,514 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 577) no Hoare annotation was computed. [2019-11-19 23:16:00,514 INFO L444 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2019-11-19 23:16:00,515 INFO L440 ceAbstractionStarter]: At program point L516-1(lines 207 546) 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 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-11-19 23:16:00,515 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-11-19 23:16:00,515 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 322) no Hoare annotation was computed. [2019-11-19 23:16:00,515 INFO L444 ceAbstractionStarter]: For program point L318-2(lines 207 546) no Hoare annotation was computed. [2019-11-19 23:16:00,516 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 578) 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 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (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 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)))) (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)) .cse0 .cse1 .cse2 .cse3 (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 12292)) .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-19 23:16:00,516 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-19 23:16:00,516 INFO L444 ceAbstractionStarter]: For program point L584(lines 584 600) no Hoare annotation was computed. [2019-11-19 23:16:00,516 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 404) no Hoare annotation was computed. [2019-11-19 23:16:00,516 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 554) no Hoare annotation was computed. [2019-11-19 23:16:00,517 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 565) no Hoare annotation was computed. [2019-11-19 23:16:00,517 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 576) no Hoare annotation was computed. [2019-11-19 23:16:00,517 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-19 23:16:00,517 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 72 614) no Hoare annotation was computed. [2019-11-19 23:16:00,517 INFO L444 ceAbstractionStarter]: For program point L618(line 618) no Hoare annotation was computed. [2019-11-19 23:16:00,518 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 599) no Hoare annotation was computed. [2019-11-19 23:16:00,518 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-11-19 23:16:00,518 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 555) 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 (<= 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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21) (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))))) [2019-11-19 23:16:00,519 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 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))) (.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))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (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)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 23:16:00,519 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 576) 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-11-19 23:16:00,519 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-19 23:16:00,520 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 591) no Hoare annotation was computed. [2019-11-19 23:16:00,520 INFO L444 ceAbstractionStarter]: For program point L586-2(lines 585 599) no Hoare annotation was computed. [2019-11-19 23:16:00,520 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:16:00,520 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 258) no Hoare annotation was computed. [2019-11-19 23:16:00,520 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 294) no Hoare annotation was computed. [2019-11-19 23:16:00,520 INFO L444 ceAbstractionStarter]: For program point L290-2(lines 290 294) no Hoare annotation was computed. [2019-11-19 23:16:00,521 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 553) no Hoare annotation was computed. [2019-11-19 23:16:00,521 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 564) no Hoare annotation was computed. [2019-11-19 23:16:00,521 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 575) no Hoare annotation was computed. [2019-11-19 23:16:00,521 INFO L444 ceAbstractionStarter]: For program point L588(lines 588 590) no Hoare annotation was computed. [2019-11-19 23:16:00,521 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 458) no Hoare annotation was computed. [2019-11-19 23:16:00,522 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 232) no Hoare annotation was computed. [2019-11-19 23:16:00,522 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 225 232) no Hoare annotation was computed. [2019-11-19 23:16:00,522 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:16:00,522 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-11-19 23:16:00,522 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-11-19 23:16:00,522 INFO L444 ceAbstractionStarter]: For program point L524-2(lines 524 528) no Hoare annotation was computed. [2019-11-19 23:16:00,523 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 433) no Hoare annotation was computed. [2019-11-19 23:16:00,523 INFO L444 ceAbstractionStarter]: For program point L425-2(lines 425 433) no Hoare annotation was computed. [2019-11-19 23:16:00,523 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-19 23:16:00,523 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 552) no Hoare annotation was computed. [2019-11-19 23:16:00,523 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 563) no Hoare annotation was computed. [2019-11-19 23:16:00,524 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 574) no Hoare annotation was computed. [2019-11-19 23:16:00,524 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 366) no Hoare annotation was computed. [2019-11-19 23:16:00,524 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 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 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 .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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .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 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse20 .cse21))) [2019-11-19 23:16:00,525 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 564) 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 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (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)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse7 (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)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 23:16:00,525 INFO L444 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-11-19 23:16:00,525 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 431) no Hoare annotation was computed. [2019-11-19 23:16:00,526 INFO L440 ceAbstractionStarter]: At program point L395(lines 386 404) 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))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (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)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 23:16:00,526 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 551) no Hoare annotation was computed. [2019-11-19 23:16:00,526 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 562) no Hoare annotation was computed. [2019-11-19 23:16:00,526 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 573) no Hoare annotation was computed. [2019-11-19 23:16:00,527 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 602) the Hoare annotation is: (let ((.cse17 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse6 (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))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse0 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse16 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse17 .cse18) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse17 (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)) .cse18 .cse8) (and (and .cse1 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse9 .cse10 .cse11) .cse0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (and .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-19 23:16:00,527 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2019-11-19 23:16:00,527 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 365) no Hoare annotation was computed. [2019-11-19 23:16:00,527 INFO L444 ceAbstractionStarter]: For program point L330-1(lines 330 365) no Hoare annotation was computed. [2019-11-19 23:16:00,528 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 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 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 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))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.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 .cse13)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2019-11-19 23:16:00,528 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 575) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (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))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse11 .cse12 .cse13 .cse14 .cse15)) (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)) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse8 .cse9 (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)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse12 .cse13 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse13 .cse14 .cse15) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-19 23:16:00,529 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-19 23:16:00,529 INFO L444 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-19 23:16:00,529 INFO L444 ceAbstractionStarter]: For program point L496-2(lines 207 546) no Hoare annotation was computed. [2019-11-19 23:16:00,529 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 362) no Hoare annotation was computed. [2019-11-19 23:16:00,529 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-19 23:16:00,529 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 550) no Hoare annotation was computed. [2019-11-19 23:16:00,530 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 561) no Hoare annotation was computed. [2019-11-19 23:16:00,530 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 572) no Hoare annotation was computed. [2019-11-19 23:16:00,530 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 583) no Hoare annotation was computed. [2019-11-19 23:16:00,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:16:00 BoogieIcfgContainer [2019-11-19 23:16:00,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:16:00,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:16:00,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:16:00,623 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:16:00,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:26" (3/4) ... [2019-11-19 23:16:00,627 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:16:00,660 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 23:16:00,661 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 23:16:00,871 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_506f456e-2030-4aac-8b5e-bcd323e5ac33/bin/uautomizer/witness.graphml [2019-11-19 23:16:00,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:16:00,873 INFO L168 Benchmark]: Toolchain (without parser) took 35759.70 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 950.1 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 288.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:16:00,874 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:16:00,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 572.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -234.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:16:00,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:16:00,875 INFO L168 Benchmark]: Boogie Preprocessor took 60.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:16:00,876 INFO L168 Benchmark]: RCFGBuilder took 966.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 61.8 MB). Peak memory consumption was 61.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:16:00,876 INFO L168 Benchmark]: TraceAbstraction took 33838.29 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-19 23:16:00,877 INFO L168 Benchmark]: Witness Printer took 249.58 ms. Allocated memory is still 2.8 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:16:00,879 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 572.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -234.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 966.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 61.8 MB). Peak memory consumption was 61.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33838.29 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 249.58 ms. Allocated memory is still 2.8 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 618]: 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: (8448 <= s__state && ((((((((((((!(s__state == 8528) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && 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: (((((((((((((((((((((((((!(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)) && 2 == blastFlag) && !(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: 104]: Loop Invariant Derived loop invariant: (s__state <= 8448 && !(s__state == 8448) && 2 == blastFlag) || ((((((((((((((((((((((((((!(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: 621]: 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)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(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: 134]: 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 == 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)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || ((((((((((((((!(s__state == 8513) && !(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 == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((((!(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 == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((((((!(s__state == 8577) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || s__state <= 3) || ((8448 <= s__state && blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (blastFlag <= 3 && !(0 == s__hit)) - 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)) || ((((((((((((((((!(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 == 8496)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(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: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(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: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: 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 == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && (((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8640)) && !(0 == s__hit)) || (((((((((((((((!(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 == 8576)) && !(s__state == 8496)) && (((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) - InvariantResult [Line: 191]: 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 == 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)) || (((((((((((((((((((((((((!(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)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) - 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)) || (((((((((((((((!(s__state == 8513) && !(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 == 8496)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (((8448 <= s__state && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((((((!(s__state == 8577) && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && s__s3__tmp__next_state___0 <= 8576) && 2 == blastFlag)) || (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || s__state <= 3) || ((8448 <= s__state && blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 207]: 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)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - 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: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(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)) && 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)) && 2 == blastFlag) && !(s__state == 8497)) && !(s__state == 8480)) || ((((((((((((((((((((((((!(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)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(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: 146]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || (((((((((((((((((((((((((!(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: (((((((((((((((((((((((((!(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 == 8544)) && !(s__state == 8529)) && !(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)) && 2 == blastFlag) && !(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: (((8448 <= s__state && ((((((((((((((!(s__state == 8513) && !(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 == 8496)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && 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))) || ((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(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 == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && 2 == blastFlag) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((((((((((((((!(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 == 8496)) && 0 == blastFlag) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Result: SAFE, OverallTime: 33.6s, OverallIterations: 40, TraceHistogramMax: 38, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.9s, HoareTripleCheckerStatistics: 6725 SDtfs, 5197 SDslu, 2367 SDs, 0 SdLazy, 3349 SolverSat, 1340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2211 GetRequests, 2163 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3059occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 222 NumberOfFragments, 4045 HoareAnnotationTreeSize, 28 FomulaSimplifications, 34973 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 7512 FormulaSimplificationTreeSizeReductionInter, 9.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 13262 NumberOfCodeBlocks, 13262 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 13218 ConstructedInterpolants, 0 QuantifiedInterpolants, 9177165 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3245 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 44 InterpolantComputations, 38 PerfectInterpolantSequences, 86997/87153 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...