./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/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 3c83e1c64d2af1ac92027e4b29fb95a984369de1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:42:51,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:42:51,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:42:51,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:42:51,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:42:51,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:42:51,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:42:51,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:42:51,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:42:51,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:42:51,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:42:51,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:42:51,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:42:51,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:42:51,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:42:51,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:42:51,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:42:51,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:42:51,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:42:51,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:42:51,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:42:51,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:42:51,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:42:51,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:42:51,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:42:51,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:42:51,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:42:51,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:42:51,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:42:51,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:42:51,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:42:51,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:42:51,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:42:51,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:42:51,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:42:51,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:42:51,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:42:51,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:42:51,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:42:51,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:42:51,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:42:51,800 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:42:51,814 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:42:51,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:42:51,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:42:51,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:42:51,817 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:42:51,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:42:51,817 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:42:51,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:42:51,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:42:51,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:42:51,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:42:51,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:42:51,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:42:51,819 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:42:51,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:42:51,820 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:42:51,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:42:51,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:42:51,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:42:51,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:42:51,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:42:51,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:42:51,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:42:51,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:42:51,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:42:51,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:42:51,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:42:51,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:42:51,824 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_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-11-15 22:42:51,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:42:51,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:42:51,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:42:51,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:42:51,872 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:42:51,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-15 22:42:51,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/data/82ed7fba7/f80ba1abaab348c7b9824d209b37a7e8/FLAG863090370 [2019-11-15 22:42:52,446 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:42:52,447 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-15 22:42:52,464 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/data/82ed7fba7/f80ba1abaab348c7b9824d209b37a7e8/FLAG863090370 [2019-11-15 22:42:52,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/data/82ed7fba7/f80ba1abaab348c7b9824d209b37a7e8 [2019-11-15 22:42:52,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:42:52,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:42:52,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:42:52,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:42:52,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:42:52,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:42:52" (1/1) ... [2019-11-15 22:42:52,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:52, skipping insertion in model container [2019-11-15 22:42:52,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:42:52" (1/1) ... [2019-11-15 22:42:52,827 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:42:52,869 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:42:53,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:42:53,370 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:42:53,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:42:53,480 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:42:53,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53 WrapperNode [2019-11-15 22:42:53,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:42:53,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:42:53,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:42:53,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:42:53,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... [2019-11-15 22:42:53,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... [2019-11-15 22:42:53,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:42:53,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:42:53,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:42:53,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:42:53,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... [2019-11-15 22:42:53,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... [2019-11-15 22:42:53,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... [2019-11-15 22:42:53,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... [2019-11-15 22:42:53,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... [2019-11-15 22:42:53,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... [2019-11-15 22:42:53,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... [2019-11-15 22:42:53,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:42:53,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:42:53,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:42:53,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:42:53,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/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-15 22:42:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:42:53,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:42:53,835 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:42:54,580 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 22:42:54,581 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 22:42:54,582 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:42:54,582 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:42:54,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:42:54 BoogieIcfgContainer [2019-11-15 22:42:54,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:42:54,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:42:54,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:42:54,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:42:54,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:42:52" (1/3) ... [2019-11-15 22:42:54,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258878fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:42:54, skipping insertion in model container [2019-11-15 22:42:54,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:42:53" (2/3) ... [2019-11-15 22:42:54,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258878fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:42:54, skipping insertion in model container [2019-11-15 22:42:54,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:42:54" (3/3) ... [2019-11-15 22:42:54,604 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-11-15 22:42:54,623 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:42:54,631 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:42:54,645 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:42:54,680 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:42:54,680 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:42:54,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:42:54,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:42:54,681 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:42:54,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:42:54,681 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:42:54,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:42:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-15 22:42:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:42:54,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:54,711 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:54,712 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-15 22:42:54,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:54,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074585740] [2019-11-15 22:42:54,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:54,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:54,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:55,008 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-15 22:42:55,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074585740] [2019-11-15 22:42:55,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:55,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:55,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289480288] [2019-11-15 22:42:55,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:55,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:55,034 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-15 22:42:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:55,436 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-15 22:42:55,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:55,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 22:42:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:55,463 INFO L225 Difference]: With dead ends: 322 [2019-11-15 22:42:55,464 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 22:42:55,469 INFO L600 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-15 22:42:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 22:42:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-15 22:42:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:42:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-15 22:42:55,587 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-15 22:42:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:55,588 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-15 22:42:55,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-15 22:42:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:42:55,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:55,592 INFO L380 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-15 22:42:55,592 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-15 22:42:55,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:55,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922984371] [2019-11-15 22:42:55,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:55,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:55,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:55,674 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-15 22:42:55,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922984371] [2019-11-15 22:42:55,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:55,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:55,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074920154] [2019-11-15 22:42:55,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:55,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:55,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:55,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:55,678 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-15 22:42:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:55,953 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-15 22:42:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:55,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 22:42:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:55,957 INFO L225 Difference]: With dead ends: 371 [2019-11-15 22:42:55,957 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 22:42:55,959 INFO L600 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-15 22:42:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 22:42:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-15 22:42:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 22:42:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-15 22:42:55,979 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-15 22:42:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:55,980 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-15 22:42:55,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-15 22:42:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 22:42:55,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:55,985 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:55,985 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:55,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:55,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-15 22:42:55,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:55,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317683479] [2019-11-15 22:42:55,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:55,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:55,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:56,136 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-15 22:42:56,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317683479] [2019-11-15 22:42:56,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:56,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:56,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928067158] [2019-11-15 22:42:56,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:56,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:56,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:56,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:56,141 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-15 22:42:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:56,390 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-15 22:42:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:56,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 22:42:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:56,394 INFO L225 Difference]: With dead ends: 436 [2019-11-15 22:42:56,394 INFO L226 Difference]: Without dead ends: 237 [2019-11-15 22:42:56,396 INFO L600 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-15 22:42:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-15 22:42:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-15 22:42:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-15 22:42:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-15 22:42:56,430 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-15 22:42:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:56,430 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-15 22:42:56,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-15 22:42:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:42:56,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:56,437 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:56,437 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-15 22:42:56,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:56,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297468918] [2019-11-15 22:42:56,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:56,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:56,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:56,528 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-15 22:42:56,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297468918] [2019-11-15 22:42:56,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:56,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:56,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201667012] [2019-11-15 22:42:56,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:56,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:56,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:56,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:56,540 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-15 22:42:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:56,752 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-15 22:42:56,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:56,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 22:42:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:56,755 INFO L225 Difference]: With dead ends: 484 [2019-11-15 22:42:56,756 INFO L226 Difference]: Without dead ends: 254 [2019-11-15 22:42:56,757 INFO L600 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-15 22:42:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-15 22:42:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-15 22:42:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:42:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-15 22:42:56,790 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-15 22:42:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:56,791 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-15 22:42:56,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-15 22:42:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:42:56,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:56,798 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:56,798 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-15 22:42:56,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:56,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623291119] [2019-11-15 22:42:56,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:56,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:56,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:56,886 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-15 22:42:56,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623291119] [2019-11-15 22:42:56,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:56,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:56,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914688700] [2019-11-15 22:42:56,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:56,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:56,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:56,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:56,892 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-15 22:42:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:57,170 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-15 22:42:57,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:57,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 22:42:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:57,174 INFO L225 Difference]: With dead ends: 543 [2019-11-15 22:42:57,174 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 22:42:57,175 INFO L600 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-15 22:42:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 22:42:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-15 22:42:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-15 22:42:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-15 22:42:57,192 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-15 22:42:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:57,192 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-15 22:42:57,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-15 22:42:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:42:57,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:57,196 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:57,196 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:57,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-15 22:42:57,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:57,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551623545] [2019-11-15 22:42:57,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:57,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:57,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:57,313 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-15 22:42:57,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551623545] [2019-11-15 22:42:57,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:57,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:57,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467049020] [2019-11-15 22:42:57,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:57,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:57,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:57,317 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-15 22:42:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:57,504 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-15 22:42:57,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:57,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 22:42:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:57,507 INFO L225 Difference]: With dead ends: 583 [2019-11-15 22:42:57,507 INFO L226 Difference]: Without dead ends: 296 [2019-11-15 22:42:57,508 INFO L600 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-15 22:42:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-15 22:42:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-15 22:42:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-15 22:42:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-15 22:42:57,552 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-15 22:42:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:57,552 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-15 22:42:57,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-15 22:42:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:42:57,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:57,554 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:57,554 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-15 22:42:57,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:57,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162852389] [2019-11-15 22:42:57,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:57,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:57,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:57,626 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-15 22:42:57,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162852389] [2019-11-15 22:42:57,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:57,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:57,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706070459] [2019-11-15 22:42:57,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:57,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:57,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:57,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:57,630 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-15 22:42:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:57,864 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-15 22:42:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:57,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 22:42:57,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:57,868 INFO L225 Difference]: With dead ends: 585 [2019-11-15 22:42:57,869 INFO L226 Difference]: Without dead ends: 296 [2019-11-15 22:42:57,869 INFO L600 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-15 22:42:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-15 22:42:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-15 22:42:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-15 22:42:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-15 22:42:57,883 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-15 22:42:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:57,884 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-15 22:42:57,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-15 22:42:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:42:57,886 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:57,886 INFO L380 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] [2019-11-15 22:42:57,887 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-15 22:42:57,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:57,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685410456] [2019-11-15 22:42:57,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:57,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:57,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:57,935 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-15 22:42:57,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685410456] [2019-11-15 22:42:57,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:57,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:57,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10149813] [2019-11-15 22:42:57,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:57,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:57,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:57,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:57,938 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-15 22:42:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:58,094 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-15 22:42:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:58,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-15 22:42:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:58,097 INFO L225 Difference]: With dead ends: 585 [2019-11-15 22:42:58,097 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 22:42:58,098 INFO L600 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-15 22:42:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 22:42:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-15 22:42:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-15 22:42:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-15 22:42:58,124 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-15 22:42:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:58,124 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-15 22:42:58,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-15 22:42:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:42:58,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:58,126 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:58,127 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-15 22:42:58,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:58,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837500817] [2019-11-15 22:42:58,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:58,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:58,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:58,199 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-15 22:42:58,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837500817] [2019-11-15 22:42:58,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:58,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:58,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083220930] [2019-11-15 22:42:58,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:58,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:58,202 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-15 22:42:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:58,416 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-15 22:42:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:58,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-15 22:42:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:58,419 INFO L225 Difference]: With dead ends: 624 [2019-11-15 22:42:58,419 INFO L226 Difference]: Without dead ends: 331 [2019-11-15 22:42:58,420 INFO L600 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-15 22:42:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-15 22:42:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-15 22:42:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-15 22:42:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-15 22:42:58,436 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-15 22:42:58,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:58,437 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-15 22:42:58,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-15 22:42:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:42:58,440 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:58,440 INFO L380 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] [2019-11-15 22:42:58,441 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:58,442 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-15 22:42:58,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:58,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752864739] [2019-11-15 22:42:58,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:58,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:58,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:58,500 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-15 22:42:58,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752864739] [2019-11-15 22:42:58,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:58,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:58,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192378759] [2019-11-15 22:42:58,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:58,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:58,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:58,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:58,505 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-15 22:42:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:58,722 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-15 22:42:58,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:58,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 22:42:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:58,726 INFO L225 Difference]: With dead ends: 685 [2019-11-15 22:42:58,726 INFO L226 Difference]: Without dead ends: 363 [2019-11-15 22:42:58,727 INFO L600 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-15 22:42:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-15 22:42:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-15 22:42:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-15 22:42:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-15 22:42:58,743 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-15 22:42:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:58,745 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-15 22:42:58,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-15 22:42:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:42:58,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:58,747 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:58,748 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-15 22:42:58,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:58,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410048004] [2019-11-15 22:42:58,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:58,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:58,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:58,814 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-15 22:42:58,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410048004] [2019-11-15 22:42:58,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:58,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:58,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401106424] [2019-11-15 22:42:58,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:58,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:58,816 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-15 22:42:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:59,002 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-15 22:42:59,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:59,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 22:42:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:59,005 INFO L225 Difference]: With dead ends: 707 [2019-11-15 22:42:59,005 INFO L226 Difference]: Without dead ends: 358 [2019-11-15 22:42:59,006 INFO L600 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-15 22:42:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-15 22:42:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-15 22:42:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-15 22:42:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-15 22:42:59,021 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-15 22:42:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:59,022 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-15 22:42:59,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-15 22:42:59,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:42:59,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:59,024 INFO L380 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] [2019-11-15 22:42:59,024 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:59,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-15 22:42:59,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:59,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156422375] [2019-11-15 22:42:59,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:59,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:59,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:59,071 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-15 22:42:59,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156422375] [2019-11-15 22:42:59,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:59,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:59,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982770274] [2019-11-15 22:42:59,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:59,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:59,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:59,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:59,073 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-15 22:42:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:59,270 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-15 22:42:59,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:59,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 22:42:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:59,273 INFO L225 Difference]: With dead ends: 712 [2019-11-15 22:42:59,273 INFO L226 Difference]: Without dead ends: 363 [2019-11-15 22:42:59,274 INFO L600 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-15 22:42:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-15 22:42:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-15 22:42:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-15 22:42:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-15 22:42:59,290 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-15 22:42:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:59,290 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-15 22:42:59,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-15 22:42:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 22:42:59,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:59,292 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:59,293 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-15 22:42:59,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:59,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403781331] [2019-11-15 22:42:59,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:59,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:59,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:59,335 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-15 22:42:59,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403781331] [2019-11-15 22:42:59,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:59,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:59,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483574243] [2019-11-15 22:42:59,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:59,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:59,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:59,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:59,338 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-15 22:42:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:59,516 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-15 22:42:59,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:59,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 22:42:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:59,522 INFO L225 Difference]: With dead ends: 730 [2019-11-15 22:42:59,522 INFO L226 Difference]: Without dead ends: 381 [2019-11-15 22:42:59,523 INFO L600 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-15 22:42:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-15 22:42:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-15 22:42:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-15 22:42:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-15 22:42:59,539 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-15 22:42:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:59,539 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-15 22:42:59,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-15 22:42:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 22:42:59,542 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:59,542 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:59,542 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:59,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-15 22:42:59,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:59,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286772345] [2019-11-15 22:42:59,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:59,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:59,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:59,587 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-15 22:42:59,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286772345] [2019-11-15 22:42:59,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:59,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:42:59,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624968101] [2019-11-15 22:42:59,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:59,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:59,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:59,590 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-15 22:42:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:59,796 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-15 22:42:59,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:59,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 22:42:59,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:59,800 INFO L225 Difference]: With dead ends: 751 [2019-11-15 22:42:59,800 INFO L226 Difference]: Without dead ends: 381 [2019-11-15 22:42:59,802 INFO L600 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-15 22:42:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-15 22:42:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-15 22:42:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-15 22:42:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-15 22:42:59,821 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-15 22:42:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:42:59,822 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-15 22:42:59,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:42:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-15 22:42:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 22:42:59,825 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:42:59,825 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:42:59,825 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:42:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:42:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-15 22:42:59,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:42:59,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176507633] [2019-11-15 22:42:59,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:59,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:42:59,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:42:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:42:59,896 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-15 22:42:59,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176507633] [2019-11-15 22:42:59,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:42:59,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:42:59,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932948789] [2019-11-15 22:42:59,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:42:59,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:42:59,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:42:59,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:42:59,899 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-15 22:42:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:42:59,964 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-15 22:42:59,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:42:59,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-15 22:42:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:42:59,971 INFO L225 Difference]: With dead ends: 747 [2019-11-15 22:42:59,971 INFO L226 Difference]: Without dead ends: 745 [2019-11-15 22:42:59,972 INFO L600 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-15 22:42:59,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-15 22:43:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-15 22:43:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-15 22:43:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-15 22:43:00,043 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-15 22:43:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:00,043 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-15 22:43:00,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-15 22:43:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 22:43:00,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:00,047 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:00,047 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-15 22:43:00,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:00,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380353011] [2019-11-15 22:43:00,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:00,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:00,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:00,059 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:43:00,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137779110] [2019-11-15 22:43:00,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/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-15 22:43:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:00,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:00,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:00,225 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-15 22:43:00,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380353011] [2019-11-15 22:43:00,225 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:43:00,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137779110] [2019-11-15 22:43:00,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:00,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:43:00,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850981485] [2019-11-15 22:43:00,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:00,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:00,227 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-15 22:43:00,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:00,290 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-15 22:43:00,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:00,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 22:43:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:00,298 INFO L225 Difference]: With dead ends: 1851 [2019-11-15 22:43:00,298 INFO L226 Difference]: Without dead ends: 1113 [2019-11-15 22:43:00,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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-15 22:43:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-15 22:43:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-15 22:43:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-15 22:43:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-15 22:43:00,349 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-15 22:43:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:00,349 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-15 22:43:00,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-15 22:43:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 22:43:00,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:00,354 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 22:43:00,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:00,559 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-15 22:43:00,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:00,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458913558] [2019-11-15 22:43:00,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:00,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:00,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:00,571 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:43:00,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791118675] [2019-11-15 22:43:00,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/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-15 22:43:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:00,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:00,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 22:43:00,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458913558] [2019-11-15 22:43:00,706 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:43:00,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791118675] [2019-11-15 22:43:00,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:00,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:00,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106784600] [2019-11-15 22:43:00,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:00,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:00,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:00,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:00,709 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-15 22:43:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:00,790 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-15 22:43:00,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:00,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-15 22:43:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:00,801 INFO L225 Difference]: With dead ends: 2219 [2019-11-15 22:43:00,801 INFO L226 Difference]: Without dead ends: 1481 [2019-11-15 22:43:00,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 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-15 22:43:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-15 22:43:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-15 22:43:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-15 22:43:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-15 22:43:00,872 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-15 22:43:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:00,873 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-15 22:43:00,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-15 22:43:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 22:43:00,879 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:00,879 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:01,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:01,086 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:01,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:01,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-15 22:43:01,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:01,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151399958] [2019-11-15 22:43:01,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:01,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:01,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-15 22:43:01,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151399958] [2019-11-15 22:43:01,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:01,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:01,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840166191] [2019-11-15 22:43:01,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:01,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:01,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:01,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:01,142 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-15 22:43:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:01,379 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-15 22:43:01,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:01,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-15 22:43:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:01,391 INFO L225 Difference]: With dead ends: 3059 [2019-11-15 22:43:01,391 INFO L226 Difference]: Without dead ends: 1585 [2019-11-15 22:43:01,394 INFO L600 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-15 22:43:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-15 22:43:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-15 22:43:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-15 22:43:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-15 22:43:01,462 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-15 22:43:01,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:01,462 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-15 22:43:01,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-15 22:43:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 22:43:01,468 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:01,468 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:01,469 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-15 22:43:01,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:01,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043543106] [2019-11-15 22:43:01,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:01,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:01,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:01,481 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:43:01,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471860159] [2019-11-15 22:43:01,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/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-15 22:43:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:01,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:01,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 22:43:01,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043543106] [2019-11-15 22:43:01,629 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:43:01,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471860159] [2019-11-15 22:43:01,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:01,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:01,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098084420] [2019-11-15 22:43:01,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:01,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:01,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:01,633 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-15 22:43:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:01,728 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-15 22:43:01,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:01,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-15 22:43:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:01,742 INFO L225 Difference]: With dead ends: 3139 [2019-11-15 22:43:01,742 INFO L226 Difference]: Without dead ends: 1964 [2019-11-15 22:43:01,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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-15 22:43:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-15 22:43:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-15 22:43:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-15 22:43:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-15 22:43:01,826 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-15 22:43:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:01,827 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-15 22:43:01,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-15 22:43:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 22:43:01,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:01,834 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:02,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:02,040 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:02,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:02,041 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-15 22:43:02,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:02,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805059208] [2019-11-15 22:43:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:02,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:02,063 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:43:02,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125194854] [2019-11-15 22:43:02,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/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-15 22:43:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:02,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:43:02,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-15 22:43:02,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805059208] [2019-11-15 22:43:02,269 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:43:02,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125194854] [2019-11-15 22:43:02,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:02,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:02,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87994045] [2019-11-15 22:43:02,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:02,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:02,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:02,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:02,272 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-15 22:43:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:02,455 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-15 22:43:02,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:02,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-15 22:43:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:02,480 INFO L225 Difference]: With dead ends: 5743 [2019-11-15 22:43:02,480 INFO L226 Difference]: Without dead ends: 3786 [2019-11-15 22:43:02,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 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-15 22:43:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-15 22:43:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-15 22:43:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-15 22:43:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-15 22:43:02,643 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-15 22:43:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:02,643 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-15 22:43:02,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-15 22:43:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-15 22:43:02,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:02,656 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:02,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:02,862 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:02,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-15 22:43:02,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:02,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110803933] [2019-11-15 22:43:02,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:02,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:02,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:02,879 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:43:02,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977173118] [2019-11-15 22:43:02,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:03,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:03,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-15 22:43:03,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110803933] [2019-11-15 22:43:03,083 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:43:03,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977173118] [2019-11-15 22:43:03,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:03,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:03,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392920460] [2019-11-15 22:43:03,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:03,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:03,086 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-15 22:43:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:03,453 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-15 22:43:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:03,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-15 22:43:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:03,480 INFO L225 Difference]: With dead ends: 7651 [2019-11-15 22:43:03,480 INFO L226 Difference]: Without dead ends: 3874 [2019-11-15 22:43:03,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 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-15 22:43:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-15 22:43:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-15 22:43:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-15 22:43:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-15 22:43:03,653 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-15 22:43:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:03,653 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-15 22:43:03,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-15 22:43:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-15 22:43:03,666 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:03,667 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-15 22:43:03,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:03,871 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:03,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-15 22:43:03,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:03,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565132602] [2019-11-15 22:43:03,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:03,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:03,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-15 22:43:03,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565132602] [2019-11-15 22:43:03,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:03,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:03,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894437155] [2019-11-15 22:43:03,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:03,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:03,981 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-15 22:43:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:04,315 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-15 22:43:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:04,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-15 22:43:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:04,341 INFO L225 Difference]: With dead ends: 7683 [2019-11-15 22:43:04,341 INFO L226 Difference]: Without dead ends: 3906 [2019-11-15 22:43:04,349 INFO L600 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-15 22:43:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-15 22:43:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-15 22:43:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-15 22:43:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-15 22:43:04,559 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-15 22:43:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:04,559 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-15 22:43:04,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-15 22:43:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-15 22:43:04,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:04,573 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:04,574 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:04,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:04,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-15 22:43:04,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:04,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966378019] [2019-11-15 22:43:04,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:04,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:04,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:04,597 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:43:04,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404206420] [2019-11-15 22:43:04,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:04,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:43:04,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-15 22:43:04,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966378019] [2019-11-15 22:43:04,793 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:43:04,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404206420] [2019-11-15 22:43:04,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:04,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:04,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49533052] [2019-11-15 22:43:04,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:04,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:04,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:04,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:04,795 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-15 22:43:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:05,081 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-15 22:43:05,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:05,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-15 22:43:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:05,113 INFO L225 Difference]: With dead ends: 7561 [2019-11-15 22:43:05,119 INFO L226 Difference]: Without dead ends: 3784 [2019-11-15 22:43:05,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 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-15 22:43:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-15 22:43:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-15 22:43:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-15 22:43:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-15 22:43:05,265 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-15 22:43:05,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:05,266 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-15 22:43:05,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-15 22:43:05,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-15 22:43:05,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:05,279 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:05,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:05,484 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-15 22:43:05,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:05,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092695819] [2019-11-15 22:43:05,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:05,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:05,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:05,502 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:43:05,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220363357] [2019-11-15 22:43:05,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:05,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:05,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-15 22:43:05,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092695819] [2019-11-15 22:43:05,716 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:43:05,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220363357] [2019-11-15 22:43:05,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:05,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:05,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435105860] [2019-11-15 22:43:05,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:05,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:05,719 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-15 22:43:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:05,998 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-15 22:43:05,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:05,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-15 22:43:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:06,006 INFO L225 Difference]: With dead ends: 7951 [2019-11-15 22:43:06,007 INFO L226 Difference]: Without dead ends: 2307 [2019-11-15 22:43:06,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 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-15 22:43:06,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-15 22:43:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-15 22:43:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-15 22:43:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-15 22:43:06,086 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-15 22:43:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:06,087 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-15 22:43:06,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-15 22:43:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-15 22:43:06,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:06,099 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:06,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:06,304 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:06,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-15 22:43:06,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:06,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022620485] [2019-11-15 22:43:06,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:06,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:06,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-11-15 22:43:06,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022620485] [2019-11-15 22:43:06,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:06,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:06,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018217435] [2019-11-15 22:43:06,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:06,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:06,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:06,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:06,522 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-15 22:43:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:06,733 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-15 22:43:06,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:06,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-15 22:43:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:06,740 INFO L225 Difference]: With dead ends: 4829 [2019-11-15 22:43:06,740 INFO L226 Difference]: Without dead ends: 2529 [2019-11-15 22:43:06,743 INFO L600 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-15 22:43:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-15 22:43:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-15 22:43:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-15 22:43:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-15 22:43:06,811 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-15 22:43:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:06,811 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-15 22:43:06,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-15 22:43:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-15 22:43:06,822 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:06,822 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:06,823 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-15 22:43:06,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:06,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495009806] [2019-11-15 22:43:06,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:06,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:06,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-15 22:43:06,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495009806] [2019-11-15 22:43:06,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:06,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:06,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576538538] [2019-11-15 22:43:06,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:06,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:06,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:06,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:06,968 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-15 22:43:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:07,194 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-15 22:43:07,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:07,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-15 22:43:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:07,201 INFO L225 Difference]: With dead ends: 4949 [2019-11-15 22:43:07,201 INFO L226 Difference]: Without dead ends: 2499 [2019-11-15 22:43:07,205 INFO L600 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-15 22:43:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-15 22:43:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-15 22:43:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-15 22:43:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-15 22:43:07,273 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-15 22:43:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:07,273 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-15 22:43:07,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-15 22:43:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-15 22:43:07,281 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:07,281 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:07,282 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:07,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-15 22:43:07,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:07,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062304779] [2019-11-15 22:43:07,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:07,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:07,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-15 22:43:07,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062304779] [2019-11-15 22:43:07,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196185182] [2019-11-15 22:43:07,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:07,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:43:07,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-15 22:43:07,772 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:43:07,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:43:07,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650691450] [2019-11-15 22:43:07,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:07,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:07,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:07,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:07,774 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-15 22:43:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:08,268 INFO L93 Difference]: Finished difference Result 6557 states and 9123 transitions. [2019-11-15 22:43:08,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:43:08,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-15 22:43:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:08,278 INFO L225 Difference]: With dead ends: 6557 [2019-11-15 22:43:08,278 INFO L226 Difference]: Without dead ends: 3975 [2019-11-15 22:43:08,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 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-15 22:43:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-11-15 22:43:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2534. [2019-11-15 22:43:08,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-15 22:43:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-15 22:43:08,365 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-15 22:43:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:08,366 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-15 22:43:08,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-15 22:43:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-15 22:43:08,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:08,373 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:08,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:08,577 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-15 22:43:08,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:08,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209470513] [2019-11-15 22:43:08,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:08,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:08,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-11-15 22:43:08,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209470513] [2019-11-15 22:43:08,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:08,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:08,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563107624] [2019-11-15 22:43:08,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:08,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:08,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:08,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:08,772 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-15 22:43:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:09,006 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-15 22:43:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:09,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-15 22:43:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:09,013 INFO L225 Difference]: With dead ends: 5073 [2019-11-15 22:43:09,013 INFO L226 Difference]: Without dead ends: 2546 [2019-11-15 22:43:09,016 INFO L600 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-15 22:43:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-15 22:43:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-15 22:43:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-15 22:43:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-15 22:43:09,098 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-15 22:43:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:09,099 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-15 22:43:09,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-15 22:43:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-15 22:43:09,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:09,110 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:09,110 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-15 22:43:09,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:09,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290290735] [2019-11-15 22:43:09,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:09,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:09,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-11-15 22:43:09,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290290735] [2019-11-15 22:43:09,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:09,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:09,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560359916] [2019-11-15 22:43:09,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:09,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:09,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:09,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:09,422 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-15 22:43:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:09,672 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-15 22:43:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:09,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-15 22:43:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:09,679 INFO L225 Difference]: With dead ends: 5277 [2019-11-15 22:43:09,679 INFO L226 Difference]: Without dead ends: 2750 [2019-11-15 22:43:09,685 INFO L600 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-15 22:43:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-15 22:43:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-15 22:43:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-15 22:43:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-15 22:43:09,764 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-15 22:43:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:09,764 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-15 22:43:09,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-15 22:43:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-15 22:43:09,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:09,773 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:09,773 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:09,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-15 22:43:09,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:09,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813478699] [2019-11-15 22:43:09,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:09,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:09,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-11-15 22:43:10,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813478699] [2019-11-15 22:43:10,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:10,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:10,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723410398] [2019-11-15 22:43:10,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:10,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:10,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:10,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:43:10,055 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-15 22:43:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:10,316 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-15 22:43:10,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:10,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-15 22:43:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:10,322 INFO L225 Difference]: With dead ends: 5697 [2019-11-15 22:43:10,323 INFO L226 Difference]: Without dead ends: 2966 [2019-11-15 22:43:10,327 INFO L600 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-15 22:43:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-15 22:43:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-15 22:43:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-15 22:43:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-15 22:43:10,410 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-15 22:43:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:10,411 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-15 22:43:10,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-15 22:43:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-15 22:43:10,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:10,420 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:10,421 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-15 22:43:10,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:10,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919359500] [2019-11-15 22:43:10,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:10,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:10,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-15 22:43:10,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919359500] [2019-11-15 22:43:10,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619082534] [2019-11-15 22:43:10,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:11,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:43:11,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-15 22:43:11,358 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:43:11,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:43:11,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138823351] [2019-11-15 22:43:11,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:11,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:11,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:11,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:11,362 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-15 22:43:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:11,665 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-15 22:43:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:11,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-15 22:43:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:11,667 INFO L225 Difference]: With dead ends: 4704 [2019-11-15 22:43:11,667 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:43:11,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 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-15 22:43:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:43:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:43:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:43:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:43:11,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-15 22:43:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:11,712 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:43:11,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:43:11,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:43:11,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:11,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:43:12,651 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-15 22:43:12,871 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-15 22:43:13,237 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-15 22:43:13,435 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-15 22:43:13,789 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-15 22:43:14,054 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-15 22:43:14,332 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-15 22:43:14,601 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-15 22:43:14,881 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-15 22:43:15,212 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-15 22:43:15,477 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-15 22:43:15,792 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-15 22:43:16,012 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-15 22:43:16,313 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-15 22:43:16,550 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-15 22:43:16,683 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-15 22:43:16,918 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-15 22:43:17,111 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-15 22:43:17,389 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-15 22:43:17,584 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-15 22:43:17,728 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-15 22:43:17,730 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-15 22:43:17,730 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-11-15 22:43:17,730 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-11-15 22:43:17,730 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-11-15 22:43:17,730 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-11-15 22:43:17,730 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-15 22:43:17,731 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-15 22:43:17,731 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 624) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-15 22:43:17,731 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-11-15 22:43:17,731 INFO L443 ceAbstractionStarter]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 22:43:17,731 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-15 22:43:17,731 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-11-15 22:43:17,731 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-11-15 22:43:17,732 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-11-15 22:43:17,732 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-11-15 22:43:17,732 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:43:17,732 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.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 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,733 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-15 22:43:17,733 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-15 22:43:17,733 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-15 22:43:17,733 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-11-15 22:43:17,733 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-11-15 22:43:17,733 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-15 22:43:17,733 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 22:43:17,733 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-11-15 22:43:17,733 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-11-15 22:43:17,733 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-11-15 22:43:17,734 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-15 22:43:17,734 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:43:17,734 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-15 22:43:17,734 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-15 22:43:17,734 INFO L446 ceAbstractionStarter]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-11-15 22:43:17,734 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-15 22:43:17,734 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-15 22:43:17,735 INFO L439 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-15 22:43:17,735 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-15 22:43:17,735 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 22:43:17,735 INFO L446 ceAbstractionStarter]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-11-15 22:43:17,735 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-11-15 22:43:17,735 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-11-15 22:43:17,735 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-11-15 22:43:17,735 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-11-15 22:43:17,735 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-15 22:43:17,736 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.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 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,736 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 611) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,736 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-15 22:43:17,736 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 623) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (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 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-11-15 22:43:17,736 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-11-15 22:43:17,737 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-11-15 22:43:17,738 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-15 22:43:17,738 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-15 22:43:17,738 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-15 22:43:17,738 INFO L443 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-15 22:43:17,738 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-15 22:43:17,738 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.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 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,739 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 609) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,739 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 22:43:17,739 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:43:17,745 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-11-15 22:43:17,746 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-11-15 22:43:17,746 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-11-15 22:43:17,746 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-11-15 22:43:17,746 INFO L439 ceAbstractionStarter]: At program point L550(lines 64 673) the Hoare annotation is: false [2019-11-15 22:43:17,747 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-15 22:43:17,747 INFO L443 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-15 22:43:17,747 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 619) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-15 22:43:17,747 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L446 ceAbstractionStarter]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-15 22:43:17,748 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:43:17,749 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 22:43:17,749 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.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 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,749 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 607) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-15 22:43:17,749 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 617) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (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 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-15 22:43:17,749 INFO L439 ceAbstractionStarter]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-15 22:43:17,749 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:43:17,750 INFO L446 ceAbstractionStarter]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-11-15 22:43:17,751 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-11-15 22:43:17,751 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-11-15 22:43:17,751 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-11-15 22:43:17,751 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-11-15 22:43:17,751 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-15 22:43:17,751 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (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 .cse8 .cse9 .cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-15 22:43:17,751 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 605) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (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 8481)) (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)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,751 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 22:43:17,751 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-15 22:43:17,752 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-15 22:43:17,753 INFO L439 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,753 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-15 22:43:17,753 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-11-15 22:43:17,753 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-11-15 22:43:17,753 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-11-15 22:43:17,754 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-15 22:43:17,754 INFO L439 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-15 22:43:17,754 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,754 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-15 22:43:17,754 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 22:43:17,754 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-11-15 22:43:17,755 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-15 22:43:17,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:43:17 BoogieIcfgContainer [2019-11-15 22:43:17,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:43:17,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:43:17,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:43:17,829 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:43:17,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:42:54" (3/4) ... [2019-11-15 22:43:17,833 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:43:17,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:43:17,854 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:43:18,013 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_661f9e8e-11e0-4ef1-ae0d-8cf2a1a2bbcf/bin/uautomizer/witness.graphml [2019-11-15 22:43:18,013 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:43:18,015 INFO L168 Benchmark]: Toolchain (without parser) took 25207.02 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 748.7 MB). Free memory was 950.2 MB in the beginning and 788.2 MB in the end (delta: 162.0 MB). Peak memory consumption was 910.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:18,015 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:18,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 950.2 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:18,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:18,016 INFO L168 Benchmark]: Boogie Preprocessor took 44.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:43:18,017 INFO L168 Benchmark]: RCFGBuilder took 983.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:18,017 INFO L168 Benchmark]: TraceAbstraction took 23243.10 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 592.4 MB). Free memory was 1.1 GB in the beginning and 811.2 MB in the end (delta: 257.3 MB). Peak memory consumption was 849.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:18,018 INFO L168 Benchmark]: Witness Printer took 184.52 ms. Allocated memory is still 1.8 GB. Free memory was 811.2 MB in the beginning and 788.2 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:43:18,021 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 672.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 950.2 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 983.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23243.10 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 592.4 MB). Free memory was 1.1 GB in the beginning and 811.2 MB in the end (delta: 257.3 MB). Peak memory consumption was 849.7 MB. Max. memory is 11.5 GB. * Witness Printer took 184.52 ms. Allocated memory is still 1.8 GB. Free memory was 811.2 MB in the beginning and 788.2 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: 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: 126]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || ((blastFlag <= 2 && s__state == 8448) && s__s3__tmp__next_state___0 <= 8576)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) || ((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8497)) && !(s__state == 8496)) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 23.0s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, HoareTripleCheckerStatistics: 5245 SDtfs, 3316 SDslu, 2433 SDs, 0 SdLazy, 2970 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1911 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40537 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6399 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3918 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 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...