./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.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_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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 96aededabe895f84f71d6d614ed1af512bf7353b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25:12,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:25:12,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:25:12,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:25:12,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:25:12,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:25:12,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:25:12,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:25:12,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:25:12,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:25:12,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:25:12,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:25:12,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:25:12,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:25:12,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:25:12,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:25:12,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:25:12,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:25:12,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:25:12,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:25:12,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:25:12,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:25:12,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:25:12,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:25:12,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:25:12,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:25:12,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:25:12,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:25:12,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:25:12,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:25:12,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:25:12,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:25:12,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:25:12,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:25:12,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:25:12,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:25:12,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:25:12,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:25:12,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:25:12,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:25:12,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:25:12,713 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:25:12,736 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:25:12,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:25:12,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:25:12,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:25:12,738 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:25:12,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:25:12,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:25:12,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:25:12,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:25:12,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:25:12,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:25:12,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:25:12,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:25:12,740 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:25:12,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:25:12,740 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:25:12,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:25:12,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:25:12,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:25:12,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:25:12,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:25:12,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:25:12,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:25:12,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:25:12,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:25:12,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:25:12,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:25:12,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:25:12,743 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_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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 -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-11-15 22:25:12,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:25:12,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:25:12,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:25:12,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:25:12,812 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:25:12,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-15 22:25:12,876 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/data/52f17d140/4bc0317d8e66400db46416b1a8aa2ddc/FLAG130114f3a [2019-11-15 22:25:13,289 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:25:13,289 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-15 22:25:13,302 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/data/52f17d140/4bc0317d8e66400db46416b1a8aa2ddc/FLAG130114f3a [2019-11-15 22:25:13,662 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/data/52f17d140/4bc0317d8e66400db46416b1a8aa2ddc [2019-11-15 22:25:13,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:25:13,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:25:13,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:25:13,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:25:13,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:25:13,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:25:13" (1/1) ... [2019-11-15 22:25:13,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55009174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:13, skipping insertion in model container [2019-11-15 22:25:13,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:25:13" (1/1) ... [2019-11-15 22:25:13,679 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:25:13,728 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:25:14,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:25:14,012 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:25:14,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:25:14,077 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:25:14,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14 WrapperNode [2019-11-15 22:25:14,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:25:14,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:25:14,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:25:14,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:25:14,089 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:25:14" (1/1) ... [2019-11-15 22:25:14,099 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:25:14" (1/1) ... [2019-11-15 22:25:14,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:25:14,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:25:14,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:25:14,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:25:14,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14" (1/1) ... [2019-11-15 22:25:14,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14" (1/1) ... [2019-11-15 22:25:14,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14" (1/1) ... [2019-11-15 22:25:14,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14" (1/1) ... [2019-11-15 22:25:14,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14" (1/1) ... [2019-11-15 22:25:14,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14" (1/1) ... [2019-11-15 22:25:14,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14" (1/1) ... [2019-11-15 22:25:14,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:25:14,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:25:14,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:25:14,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:25:14,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:14,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:25:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:25:14,361 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:25:14,978 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 22:25:14,978 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 22:25:14,980 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:25:14,980 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:25:14,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:14 BoogieIcfgContainer [2019-11-15 22:25:14,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:25:14,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:25:14,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:25:14,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:25:14,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:25:13" (1/3) ... [2019-11-15 22:25:14,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b22657e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:25:14, skipping insertion in model container [2019-11-15 22:25:14,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:25:14" (2/3) ... [2019-11-15 22:25:14,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b22657e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:25:14, skipping insertion in model container [2019-11-15 22:25:14,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:14" (3/3) ... [2019-11-15 22:25:14,997 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-11-15 22:25:15,005 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:25:15,011 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:25:15,021 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:25:15,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:25:15,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:25:15,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:25:15,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:25:15,044 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:25:15,044 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:25:15,044 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:25:15,044 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:25:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-15 22:25:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:25:15,070 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:15,071 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:25:15,073 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:15,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:15,078 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-15 22:25:15,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:15,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091335007] [2019-11-15 22:25:15,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:15,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:15,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:15,270 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:25:15,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091335007] [2019-11-15 22:25:15,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:15,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:15,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157283657] [2019-11-15 22:25:15,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:15,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:15,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:15,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:15,291 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-15 22:25:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:15,579 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-15 22:25:15,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:15,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 22:25:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:15,592 INFO L225 Difference]: With dead ends: 322 [2019-11-15 22:25:15,592 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 22:25:15,596 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:25:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 22:25:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-15 22:25:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:25:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-15 22:25:15,650 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-15 22:25:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:15,651 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-15 22:25:15,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-15 22:25:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:25:15,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:15,659 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:25:15,659 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-15 22:25:15,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:15,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707102236] [2019-11-15 22:25:15,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:15,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:15,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:15,751 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:25:15,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707102236] [2019-11-15 22:25:15,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:15,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:15,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178281791] [2019-11-15 22:25:15,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:15,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:15,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:15,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:15,754 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-15 22:25:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:16,008 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-15 22:25:16,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:16,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 22:25:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:16,012 INFO L225 Difference]: With dead ends: 371 [2019-11-15 22:25:16,012 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 22:25:16,014 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:25:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 22:25:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-15 22:25:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 22:25:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-15 22:25:16,047 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-15 22:25:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:16,047 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-15 22:25:16,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-15 22:25:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 22:25:16,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:16,057 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:25:16,058 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:16,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-15 22:25:16,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:16,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143706566] [2019-11-15 22:25:16,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:16,168 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:25:16,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143706566] [2019-11-15 22:25:16,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:16,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:16,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451764328] [2019-11-15 22:25:16,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:16,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:16,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:16,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:16,176 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-15 22:25:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:16,369 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-15 22:25:16,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:16,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 22:25:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:16,372 INFO L225 Difference]: With dead ends: 436 [2019-11-15 22:25:16,372 INFO L226 Difference]: Without dead ends: 237 [2019-11-15 22:25:16,374 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:25:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-15 22:25:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-15 22:25:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-15 22:25:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-15 22:25:16,392 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-15 22:25:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:16,393 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-15 22:25:16,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-15 22:25:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:25:16,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:16,396 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:25:16,396 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-15 22:25:16,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:16,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20046245] [2019-11-15 22:25:16,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:16,467 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:25:16,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20046245] [2019-11-15 22:25:16,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:16,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:16,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687939554] [2019-11-15 22:25:16,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:16,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:16,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:16,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:16,471 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-15 22:25:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:16,631 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-15 22:25:16,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:16,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 22:25:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:16,634 INFO L225 Difference]: With dead ends: 484 [2019-11-15 22:25:16,634 INFO L226 Difference]: Without dead ends: 254 [2019-11-15 22:25:16,636 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:25:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-15 22:25:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-15 22:25:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:25:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-15 22:25:16,655 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-15 22:25:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:16,655 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-15 22:25:16,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-15 22:25:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:25:16,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:16,657 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:25:16,657 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-15 22:25:16,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:16,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533513953] [2019-11-15 22:25:16,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:16,762 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:25:16,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533513953] [2019-11-15 22:25:16,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:16,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:16,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017628993] [2019-11-15 22:25:16,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:16,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:16,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:16,763 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-15 22:25:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:16,962 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-15 22:25:16,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:16,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 22:25:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:16,965 INFO L225 Difference]: With dead ends: 543 [2019-11-15 22:25:16,965 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 22:25:16,965 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:25:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 22:25:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-15 22:25:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-15 22:25:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-15 22:25:16,978 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-15 22:25:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:16,978 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-15 22:25:16,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-15 22:25:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:25:16,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:16,980 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:25:16,980 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-15 22:25:16,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:16,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752165134] [2019-11-15 22:25:16,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:17,024 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:25:17,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752165134] [2019-11-15 22:25:17,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:17,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:17,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136359549] [2019-11-15 22:25:17,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:17,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:17,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:17,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:17,027 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-15 22:25:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:17,155 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-15 22:25:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:17,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 22:25:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:17,158 INFO L225 Difference]: With dead ends: 583 [2019-11-15 22:25:17,158 INFO L226 Difference]: Without dead ends: 296 [2019-11-15 22:25:17,159 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:25:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-15 22:25:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-15 22:25:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-15 22:25:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-15 22:25:17,169 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-15 22:25:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:17,169 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-15 22:25:17,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-15 22:25:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:25:17,171 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:17,171 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:25:17,171 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-15 22:25:17,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:17,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975928126] [2019-11-15 22:25:17,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:17,232 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:25:17,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975928126] [2019-11-15 22:25:17,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:17,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:17,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706414486] [2019-11-15 22:25:17,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:17,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:17,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:17,235 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-15 22:25:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:17,416 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-15 22:25:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:17,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 22:25:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:17,419 INFO L225 Difference]: With dead ends: 585 [2019-11-15 22:25:17,419 INFO L226 Difference]: Without dead ends: 296 [2019-11-15 22:25:17,419 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:25:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-15 22:25:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-15 22:25:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-15 22:25:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-15 22:25:17,432 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-15 22:25:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:17,433 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-15 22:25:17,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-15 22:25:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:25:17,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:17,434 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:25:17,435 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:17,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:17,435 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-15 22:25:17,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:17,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211749474] [2019-11-15 22:25:17,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:17,491 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:25:17,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211749474] [2019-11-15 22:25:17,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:17,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:17,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644624371] [2019-11-15 22:25:17,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:17,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:17,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:17,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:17,494 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-15 22:25:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:17,607 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-15 22:25:17,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:17,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-15 22:25:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:17,610 INFO L225 Difference]: With dead ends: 585 [2019-11-15 22:25:17,610 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 22:25:17,610 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:25:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 22:25:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-15 22:25:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-15 22:25:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-15 22:25:17,621 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-15 22:25:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:17,621 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-15 22:25:17,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-15 22:25:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:25:17,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:17,623 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:25:17,623 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-15 22:25:17,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:17,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027891873] [2019-11-15 22:25:17,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:17,666 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:25:17,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027891873] [2019-11-15 22:25:17,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:17,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:17,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987340775] [2019-11-15 22:25:17,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:17,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:17,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:17,668 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-15 22:25:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:17,826 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-15 22:25:17,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:17,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-15 22:25:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:17,829 INFO L225 Difference]: With dead ends: 624 [2019-11-15 22:25:17,829 INFO L226 Difference]: Without dead ends: 331 [2019-11-15 22:25:17,830 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:25:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-15 22:25:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-15 22:25:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-15 22:25:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-15 22:25:17,842 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-15 22:25:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:17,842 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-15 22:25:17,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-15 22:25:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:25:17,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:17,844 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:25:17,844 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-15 22:25:17,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:17,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204278463] [2019-11-15 22:25:17,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:17,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:17,886 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:25:17,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204278463] [2019-11-15 22:25:17,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:17,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:17,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061944437] [2019-11-15 22:25:17,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:17,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:17,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:17,889 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-15 22:25:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:18,065 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-15 22:25:18,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:18,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 22:25:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:18,068 INFO L225 Difference]: With dead ends: 685 [2019-11-15 22:25:18,068 INFO L226 Difference]: Without dead ends: 363 [2019-11-15 22:25:18,068 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:25:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-15 22:25:18,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-15 22:25:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-15 22:25:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-15 22:25:18,081 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-15 22:25:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:18,082 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-15 22:25:18,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-15 22:25:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:25:18,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:18,083 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:25:18,084 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-15 22:25:18,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:18,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871324299] [2019-11-15 22:25:18,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:18,118 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:25:18,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871324299] [2019-11-15 22:25:18,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:18,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:18,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182835019] [2019-11-15 22:25:18,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:18,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:18,121 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-15 22:25:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:18,263 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-15 22:25:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:18,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 22:25:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:18,266 INFO L225 Difference]: With dead ends: 707 [2019-11-15 22:25:18,266 INFO L226 Difference]: Without dead ends: 358 [2019-11-15 22:25:18,267 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:25:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-15 22:25:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-15 22:25:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-15 22:25:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-15 22:25:18,281 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-15 22:25:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:18,281 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-15 22:25:18,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-15 22:25:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:25:18,283 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:18,283 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:25:18,284 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:18,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:18,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-15 22:25:18,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:18,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754360703] [2019-11-15 22:25:18,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:18,314 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:25:18,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754360703] [2019-11-15 22:25:18,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:18,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:18,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763657941] [2019-11-15 22:25:18,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:18,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:18,316 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-15 22:25:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:18,475 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-15 22:25:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:18,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 22:25:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:18,478 INFO L225 Difference]: With dead ends: 712 [2019-11-15 22:25:18,478 INFO L226 Difference]: Without dead ends: 363 [2019-11-15 22:25:18,479 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:25:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-15 22:25:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-15 22:25:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-15 22:25:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-15 22:25:18,492 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-15 22:25:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:18,492 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-15 22:25:18,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-15 22:25:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 22:25:18,494 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:18,494 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:25:18,494 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-15 22:25:18,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:18,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688097004] [2019-11-15 22:25:18,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:18,526 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:25:18,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688097004] [2019-11-15 22:25:18,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:18,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:18,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220216539] [2019-11-15 22:25:18,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:18,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:18,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:18,528 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-15 22:25:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:18,659 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-15 22:25:18,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:18,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 22:25:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:18,662 INFO L225 Difference]: With dead ends: 730 [2019-11-15 22:25:18,662 INFO L226 Difference]: Without dead ends: 381 [2019-11-15 22:25:18,663 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:25:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-15 22:25:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-15 22:25:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-15 22:25:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-15 22:25:18,677 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-15 22:25:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:18,677 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-15 22:25:18,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-15 22:25:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 22:25:18,679 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:18,679 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:25:18,679 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:18,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-15 22:25:18,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:18,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709243347] [2019-11-15 22:25:18,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:18,708 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:25:18,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709243347] [2019-11-15 22:25:18,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:18,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:18,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218330173] [2019-11-15 22:25:18,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:18,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:18,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:18,710 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-15 22:25:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:18,844 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-15 22:25:18,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:18,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 22:25:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:18,847 INFO L225 Difference]: With dead ends: 751 [2019-11-15 22:25:18,847 INFO L226 Difference]: Without dead ends: 381 [2019-11-15 22:25:18,847 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:25:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-15 22:25:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-15 22:25:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-15 22:25:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-15 22:25:18,861 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-15 22:25:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:18,862 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-15 22:25:18,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-15 22:25:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 22:25:18,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:18,864 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:25:18,864 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:18,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-15 22:25:18,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:18,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078533260] [2019-11-15 22:25:18,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:18,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:18,915 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:25:18,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078533260] [2019-11-15 22:25:18,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:18,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:18,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65534801] [2019-11-15 22:25:18,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:18,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:18,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:18,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:18,918 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-15 22:25:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:18,961 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-15 22:25:18,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:18,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-15 22:25:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:18,966 INFO L225 Difference]: With dead ends: 747 [2019-11-15 22:25:18,966 INFO L226 Difference]: Without dead ends: 745 [2019-11-15 22:25:18,966 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:25:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-15 22:25:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-15 22:25:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-15 22:25:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-15 22:25:18,995 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-15 22:25:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:18,996 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-15 22:25:18,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-15 22:25:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 22:25:18,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:18,999 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:25:18,999 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:18,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-15 22:25:19,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:19,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933128117] [2019-11-15 22:25:19,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:19,009 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:25:19,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285136626] [2019-11-15 22:25:19,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:19,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:25:19,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:19,162 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:25:19,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933128117] [2019-11-15 22:25:19,162 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:25:19,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285136626] [2019-11-15 22:25:19,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:19,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:25:19,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954610437] [2019-11-15 22:25:19,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:19,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:19,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:19,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:19,166 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-15 22:25:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:19,245 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-15 22:25:19,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:19,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 22:25:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:19,252 INFO L225 Difference]: With dead ends: 1851 [2019-11-15 22:25:19,252 INFO L226 Difference]: Without dead ends: 1113 [2019-11-15 22:25:19,253 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:25:19,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-15 22:25:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-15 22:25:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-15 22:25:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-15 22:25:19,297 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-15 22:25:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:19,298 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-15 22:25:19,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-15 22:25:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 22:25:19,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:19,301 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:25:19,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:19,505 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-15 22:25:19,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:19,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368257792] [2019-11-15 22:25:19,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:19,514 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:25:19,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966603778] [2019-11-15 22:25:19,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:19,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:25:19,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:19,645 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:25:19,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368257792] [2019-11-15 22:25:19,645 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:25:19,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966603778] [2019-11-15 22:25:19,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:19,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:19,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995532701] [2019-11-15 22:25:19,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:19,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:19,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:19,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:19,648 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-15 22:25:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:19,718 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-15 22:25:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:19,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-15 22:25:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:19,727 INFO L225 Difference]: With dead ends: 2219 [2019-11-15 22:25:19,727 INFO L226 Difference]: Without dead ends: 1481 [2019-11-15 22:25:19,729 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:25:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-15 22:25:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-15 22:25:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-15 22:25:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-15 22:25:19,784 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-15 22:25:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:19,785 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-15 22:25:19,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-15 22:25:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 22:25:19,789 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:19,790 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:25:19,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:19,993 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:19,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:19,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-15 22:25:19,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:19,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914965720] [2019-11-15 22:25:19,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:20,055 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:25:20,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914965720] [2019-11-15 22:25:20,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:20,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:20,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58121396] [2019-11-15 22:25:20,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:20,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:20,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:20,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:20,057 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-15 22:25:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:20,237 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-15 22:25:20,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:20,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-15 22:25:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:20,246 INFO L225 Difference]: With dead ends: 3059 [2019-11-15 22:25:20,247 INFO L226 Difference]: Without dead ends: 1585 [2019-11-15 22:25:20,249 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:25:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-15 22:25:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-15 22:25:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-15 22:25:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-15 22:25:20,303 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-15 22:25:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:20,303 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-15 22:25:20,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-15 22:25:20,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 22:25:20,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:20,308 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:25:20,308 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:20,308 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-15 22:25:20,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:20,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429263304] [2019-11-15 22:25:20,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:20,318 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:25:20,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352497994] [2019-11-15 22:25:20,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:20,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:25:20,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:20,435 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:25:20,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429263304] [2019-11-15 22:25:20,436 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:25:20,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352497994] [2019-11-15 22:25:20,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:20,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:20,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599261866] [2019-11-15 22:25:20,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:20,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:20,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:20,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:20,439 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-15 22:25:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:20,510 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-15 22:25:20,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:20,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-15 22:25:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:20,523 INFO L225 Difference]: With dead ends: 3139 [2019-11-15 22:25:20,524 INFO L226 Difference]: Without dead ends: 1964 [2019-11-15 22:25:20,526 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:25:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-15 22:25:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-15 22:25:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-15 22:25:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-15 22:25:20,621 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-15 22:25:20,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:20,622 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-15 22:25:20,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-15 22:25:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 22:25:20,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:20,627 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:25:20,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:20,831 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-15 22:25:20,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:20,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759445554] [2019-11-15 22:25:20,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:20,856 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:25:20,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185245096] [2019-11-15 22:25:20,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:20,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:25:20,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:21,004 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:25:21,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759445554] [2019-11-15 22:25:21,005 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:25:21,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185245096] [2019-11-15 22:25:21,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:21,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:21,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399905954] [2019-11-15 22:25:21,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:21,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:21,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:21,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:21,007 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-15 22:25:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:21,117 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-15 22:25:21,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:21,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-15 22:25:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:21,139 INFO L225 Difference]: With dead ends: 5743 [2019-11-15 22:25:21,140 INFO L226 Difference]: Without dead ends: 3786 [2019-11-15 22:25:21,143 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:25:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-15 22:25:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-15 22:25:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-15 22:25:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-15 22:25:21,278 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-15 22:25:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:21,279 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-15 22:25:21,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-15 22:25:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-15 22:25:21,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:21,289 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:25:21,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:21,494 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-15 22:25:21,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:21,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422230960] [2019-11-15 22:25:21,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:21,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:21,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:21,506 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:25:21,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943519696] [2019-11-15 22:25:21,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:21,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:25:21,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:21,670 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:25:21,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422230960] [2019-11-15 22:25:21,671 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:25:21,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943519696] [2019-11-15 22:25:21,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:21,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:21,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583867918] [2019-11-15 22:25:21,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:21,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:21,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:21,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:21,673 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-15 22:25:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:21,976 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-15 22:25:21,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:21,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-15 22:25:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:22,001 INFO L225 Difference]: With dead ends: 7651 [2019-11-15 22:25:22,001 INFO L226 Difference]: Without dead ends: 3874 [2019-11-15 22:25:22,006 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:25:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-15 22:25:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-15 22:25:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-15 22:25:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-15 22:25:22,242 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-15 22:25:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:22,243 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-15 22:25:22,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-15 22:25:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-15 22:25:22,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:22,253 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:25:22,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:22,457 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-15 22:25:22,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:22,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376938466] [2019-11-15 22:25:22,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:22,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:22,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:22,545 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:25:22,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376938466] [2019-11-15 22:25:22,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:22,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:22,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346526799] [2019-11-15 22:25:22,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:22,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:22,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:22,549 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-15 22:25:22,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:22,827 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-15 22:25:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:22,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-15 22:25:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:22,849 INFO L225 Difference]: With dead ends: 7683 [2019-11-15 22:25:22,849 INFO L226 Difference]: Without dead ends: 3906 [2019-11-15 22:25:22,854 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:25:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-15 22:25:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-15 22:25:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-15 22:25:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-15 22:25:23,003 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-15 22:25:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:23,004 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-15 22:25:23,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-15 22:25:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-15 22:25:23,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:23,015 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:25:23,015 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:23,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-15 22:25:23,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:23,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854846264] [2019-11-15 22:25:23,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:23,031 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:25:23,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165033213] [2019-11-15 22:25:23,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:23,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:25:23,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:23,194 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:25:23,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854846264] [2019-11-15 22:25:23,195 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:25:23,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165033213] [2019-11-15 22:25:23,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:23,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:23,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334742708] [2019-11-15 22:25:23,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:23,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:23,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:23,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:23,197 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-15 22:25:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:23,440 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-15 22:25:23,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:23,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-15 22:25:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:23,465 INFO L225 Difference]: With dead ends: 7561 [2019-11-15 22:25:23,466 INFO L226 Difference]: Without dead ends: 3784 [2019-11-15 22:25:23,472 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:25:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-15 22:25:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-15 22:25:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-15 22:25:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-15 22:25:23,592 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-15 22:25:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:23,592 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-15 22:25:23,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-15 22:25:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-15 22:25:23,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:23,603 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:25:23,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:23,815 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:23,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-15 22:25:23,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:23,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224905978] [2019-11-15 22:25:23,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:23,829 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 22:25:23,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273455652] [2019-11-15 22:25:23,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:23,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:25:23,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:23,999 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:25:24,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224905978] [2019-11-15 22:25:24,000 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 22:25:24,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273455652] [2019-11-15 22:25:24,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:24,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:24,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51558484] [2019-11-15 22:25:24,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:24,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:24,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:24,005 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-15 22:25:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:24,226 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-15 22:25:24,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:24,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-15 22:25:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:24,232 INFO L225 Difference]: With dead ends: 7951 [2019-11-15 22:25:24,232 INFO L226 Difference]: Without dead ends: 2307 [2019-11-15 22:25:24,239 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:25:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-15 22:25:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-15 22:25:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-15 22:25:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-15 22:25:24,296 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-15 22:25:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:24,296 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-15 22:25:24,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-15 22:25:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-15 22:25:24,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:24,304 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:25:24,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:24,517 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:24,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:24,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-15 22:25:24,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:24,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814949815] [2019-11-15 22:25:24,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:24,622 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:25:24,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814949815] [2019-11-15 22:25:24,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:24,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:24,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551478304] [2019-11-15 22:25:24,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:24,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:24,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:24,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:24,625 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-15 22:25:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:24,822 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-15 22:25:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:24,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-15 22:25:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:24,828 INFO L225 Difference]: With dead ends: 4829 [2019-11-15 22:25:24,828 INFO L226 Difference]: Without dead ends: 2529 [2019-11-15 22:25:24,831 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:25:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-15 22:25:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-15 22:25:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-15 22:25:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-15 22:25:24,906 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-15 22:25:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:24,907 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-15 22:25:24,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-15 22:25:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-15 22:25:24,917 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:24,918 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:25:24,918 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-15 22:25:24,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:24,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144666247] [2019-11-15 22:25:24,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:25,078 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:25:25,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144666247] [2019-11-15 22:25:25,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:25,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:25,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287745407] [2019-11-15 22:25:25,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:25,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:25,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:25,081 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-15 22:25:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:25,253 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-15 22:25:25,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:25,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-15 22:25:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:25,257 INFO L225 Difference]: With dead ends: 4949 [2019-11-15 22:25:25,258 INFO L226 Difference]: Without dead ends: 2499 [2019-11-15 22:25:25,261 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:25:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-15 22:25:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-15 22:25:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-15 22:25:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-15 22:25:25,319 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-15 22:25:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:25,320 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-15 22:25:25,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-15 22:25:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-15 22:25:25,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:25,330 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:25:25,330 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-15 22:25:25,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:25,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397121113] [2019-11-15 22:25:25,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:25,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:25,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:25,474 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:25:25,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397121113] [2019-11-15 22:25:25,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339433835] [2019-11-15 22:25:25,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:25,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:25:25,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:25,716 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:25:25,717 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:25:25,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:25:25,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473498122] [2019-11-15 22:25:25,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:25,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:25,719 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-15 22:25:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:26,131 INFO L93 Difference]: Finished difference Result 7213 states and 10041 transitions. [2019-11-15 22:25:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:25:26,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-15 22:25:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:26,139 INFO L225 Difference]: With dead ends: 7213 [2019-11-15 22:25:26,139 INFO L226 Difference]: Without dead ends: 4617 [2019-11-15 22:25:26,143 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:25:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2019-11-15 22:25:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 2534. [2019-11-15 22:25:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-15 22:25:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-15 22:25:26,214 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-15 22:25:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:26,215 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-15 22:25:26,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-15 22:25:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-15 22:25:26,226 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:26,226 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:25:26,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:26,431 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-15 22:25:26,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:26,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139984712] [2019-11-15 22:25:26,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:26,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:26,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:26,588 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:25:26,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139984712] [2019-11-15 22:25:26,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:26,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:26,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117055627] [2019-11-15 22:25:26,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:26,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:26,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:26,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:26,595 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-15 22:25:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:26,781 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-15 22:25:26,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:26,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-15 22:25:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:26,785 INFO L225 Difference]: With dead ends: 5073 [2019-11-15 22:25:26,786 INFO L226 Difference]: Without dead ends: 2546 [2019-11-15 22:25:26,788 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:25:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-15 22:25:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-15 22:25:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-15 22:25:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-15 22:25:26,849 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-15 22:25:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:26,849 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-15 22:25:26,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-15 22:25:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-15 22:25:26,854 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:26,856 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:25:26,856 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-15 22:25:26,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:26,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018048301] [2019-11-15 22:25:26,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:26,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:26,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:27,125 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:25:27,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018048301] [2019-11-15 22:25:27,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:27,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:27,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039452494] [2019-11-15 22:25:27,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:27,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:27,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:27,127 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-15 22:25:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:27,316 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-15 22:25:27,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:27,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-15 22:25:27,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:27,321 INFO L225 Difference]: With dead ends: 5277 [2019-11-15 22:25:27,321 INFO L226 Difference]: Without dead ends: 2750 [2019-11-15 22:25:27,324 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:25:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-15 22:25:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-15 22:25:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-15 22:25:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-15 22:25:27,384 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-15 22:25:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:27,385 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-15 22:25:27,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-15 22:25:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-15 22:25:27,390 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:27,391 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:25:27,391 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:27,392 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-15 22:25:27,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:27,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665071148] [2019-11-15 22:25:27,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:27,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:27,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:27,611 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:25:27,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665071148] [2019-11-15 22:25:27,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:27,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:27,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396288674] [2019-11-15 22:25:27,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:27,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:27,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:27,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:27,613 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-15 22:25:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:27,804 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-15 22:25:27,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:27,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-15 22:25:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:27,809 INFO L225 Difference]: With dead ends: 5697 [2019-11-15 22:25:27,810 INFO L226 Difference]: Without dead ends: 2966 [2019-11-15 22:25:27,813 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:25:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-15 22:25:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-15 22:25:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-15 22:25:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-15 22:25:27,878 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-15 22:25:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:27,879 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-15 22:25:27,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-15 22:25:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-15 22:25:27,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:27,886 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:25:27,886 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-15 22:25:27,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:27,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649511060] [2019-11-15 22:25:27,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:27,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:27,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:28,210 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:25:28,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649511060] [2019-11-15 22:25:28,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731290212] [2019-11-15 22:25:28,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/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:25:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:28,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:25:28,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:28,605 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:25:28,605 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:25:28,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:25:28,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127432898] [2019-11-15 22:25:28,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:28,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:28,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:28,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:28,608 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-15 22:25:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:28,841 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-15 22:25:28,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:28,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-15 22:25:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:28,843 INFO L225 Difference]: With dead ends: 4704 [2019-11-15 22:25:28,843 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:25:28,847 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:25:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:25:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:25:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:25:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:25:28,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-15 22:25:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:28,849 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:25:28,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:25:28,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:25:29,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:29,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:25:29,358 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-15 22:25:29,859 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-15 22:25:30,147 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-15 22:25:30,291 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-15 22:25:30,546 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-15 22:25:30,818 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-15 22:25:31,008 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-15 22:25:31,222 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-15 22:25:31,428 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-15 22:25:31,601 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-15 22:25:31,809 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-15 22:25:31,941 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-15 22:25:32,089 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-15 22:25:32,210 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-15 22:25:32,372 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-15 22:25:32,473 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-15 22:25:32,649 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-15 22:25:32,786 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-15 22:25:32,992 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-15 22:25:33,096 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-15 22:25:33,205 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-15 22:25:33,207 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-15 22:25:33,207 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-15 22:25:33,207 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-11-15 22:25:33,207 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-11-15 22:25:33,207 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-11-15 22:25:33,207 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-11-15 22:25:33,207 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-15 22:25:33,207 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 593) 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:25:33,208 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 625) 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:25:33,208 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-11-15 22:25:33,208 INFO L443 ceAbstractionStarter]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 22:25:33,208 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-15 22:25:33,208 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-11-15 22:25:33,208 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-11-15 22:25:33,208 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-11-15 22:25:33,208 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-11-15 22:25:33,208 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:25:33,209 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 603) 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:25:33,209 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 614) 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:25:33,209 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-15 22:25:33,209 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-15 22:25:33,209 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-15 22:25:33,209 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 22:25:33,209 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-11-15 22:25:33,209 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-11-15 22:25:33,210 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-11-15 22:25:33,210 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-11-15 22:25:33,210 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-11-15 22:25:33,210 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-15 22:25:33,210 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:25:33,210 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-15 22:25:33,210 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-15 22:25:33,210 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:25:33,210 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-15 22:25:33,210 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 22:25:33,210 INFO L446 ceAbstractionStarter]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-11-15 22:25:33,210 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-11-15 22:25:33,211 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-11-15 22:25:33,211 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-11-15 22:25:33,211 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-11-15 22:25:33,211 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-11-15 22:25:33,211 INFO L446 ceAbstractionStarter]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-11-15 22:25:33,211 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-11-15 22:25:33,211 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-15 22:25:33,211 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 601) 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:25:33,211 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 612) 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:25:33,211 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-15 22:25:33,211 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 624) 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:25:33,211 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-11-15 22:25:33,212 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-11-15 22:25:33,213 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-11-15 22:25:33,213 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-11-15 22:25:33,213 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-15 22:25:33,213 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-11-15 22:25:33,213 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-15 22:25:33,213 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-11-15 22:25:33,214 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-11-15 22:25:33,214 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-11-15 22:25:33,214 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-11-15 22:25:33,214 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-15 22:25:33,214 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-15 22:25:33,214 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-15 22:25:33,214 INFO L443 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-15 22:25:33,215 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-15 22:25:33,215 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 599) 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:25:33,215 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 610) 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:25:33,215 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 22:25:33,215 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:25:33,216 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-11-15 22:25:33,216 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-11-15 22:25:33,216 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-11-15 22:25:33,216 INFO L443 ceAbstractionStarter]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-11-15 22:25:33,216 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-15 22:25:33,216 INFO L443 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-15 22:25:33,217 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 620) 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:25:33,217 INFO L439 ceAbstractionStarter]: At program point L551(lines 64 674) the Hoare annotation is: false [2019-11-15 22:25:33,217 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-11-15 22:25:33,217 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-15 22:25:33,217 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-15 22:25:33,217 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-15 22:25:33,217 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-11-15 22:25:33,218 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-11-15 22:25:33,218 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-11-15 22:25:33,218 INFO L446 ceAbstractionStarter]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-11-15 22:25:33,218 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-15 22:25:33,218 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-15 22:25:33,218 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:25:33,218 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 22:25:33,219 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 597) 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:25:33,219 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 608) 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:25:33,219 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 618) 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:25:33,219 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-11-15 22:25:33,220 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-15 22:25:33,220 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-15 22:25:33,220 INFO L439 ceAbstractionStarter]: At program point L588(lines 99 656) 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:25:33,220 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-11-15 22:25:33,220 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-15 22:25:33,220 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-15 22:25:33,221 INFO L443 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-15 22:25:33,221 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-11-15 22:25:33,221 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-11-15 22:25:33,221 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-11-15 22:25:33,221 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-15 22:25:33,221 INFO L443 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-15 22:25:33,221 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:25:33,222 INFO L446 ceAbstractionStarter]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-11-15 22:25:33,222 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-11-15 22:25:33,222 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-11-15 22:25:33,222 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-11-15 22:25:33,222 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-15 22:25:33,222 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 595) 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:25:33,223 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 606) 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:25:33,223 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 22:25:33,223 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-11-15 22:25:33,223 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-15 22:25:33,223 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-11-15 22:25:33,223 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-11-15 22:25:33,223 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-11-15 22:25:33,224 INFO L443 ceAbstractionStarter]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-11-15 22:25:33,224 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-15 22:25:33,224 INFO L443 ceAbstractionStarter]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-11-15 22:25:33,224 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-15 22:25:33,224 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:25:33,224 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-15 22:25:33,225 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-11-15 22:25:33,225 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-11-15 22:25:33,225 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-11-15 22:25:33,225 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 656) 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:25:33,225 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-11-15 22:25:33,225 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-11-15 22:25:33,225 INFO L443 ceAbstractionStarter]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-11-15 22:25:33,226 INFO L443 ceAbstractionStarter]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-11-15 22:25:33,226 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:25:33,226 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 604) 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:25:33,226 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 617) 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:25:33,227 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 22:25:33,227 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-15 22:25:33,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:25:33 BoogieIcfgContainer [2019-11-15 22:25:33,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:25:33,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:25:33,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:25:33,262 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:25:33,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:25:14" (3/4) ... [2019-11-15 22:25:33,265 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:25:33,281 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:25:33,282 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:25:33,388 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_77f581ac-9b55-4a9f-b433-4b25e1a2224b/bin/uautomizer/witness.graphml [2019-11-15 22:25:33,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:25:33,389 INFO L168 Benchmark]: Toolchain (without parser) took 19724.01 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 769.1 MB). Free memory was 942.0 MB in the beginning and 847.9 MB in the end (delta: 94.2 MB). Peak memory consumption was 863.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:33,390 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:25:33,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:33,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.28 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:25:33,391 INFO L168 Benchmark]: Boogie Preprocessor took 57.99 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:33,391 INFO L168 Benchmark]: RCFGBuilder took 790.17 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:33,391 INFO L168 Benchmark]: TraceAbstraction took 18278.33 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 636.5 MB). Free memory was 1.1 GB in the beginning and 872.3 MB in the end (delta: 188.8 MB). Peak memory consumption was 862.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:33,392 INFO L168 Benchmark]: Witness Printer took 126.76 ms. Allocated memory is still 1.8 GB. Free memory was 872.3 MB in the beginning and 847.9 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:33,393 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.28 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 57.99 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 790.17 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18278.33 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 636.5 MB). Free memory was 1.1 GB in the beginning and 872.3 MB in the end (delta: 188.8 MB). Peak memory consumption was 862.9 MB. Max. memory is 11.5 GB. * Witness Printer took 126.76 ms. Allocated memory is still 1.8 GB. Free memory was 872.3 MB in the beginning and 847.9 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: 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: 676]: Loop Invariant Derived loop invariant: 1 - 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: 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: 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: 64]: 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: 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: 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: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - 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: 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: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - 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: 18.1s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, HoareTripleCheckerStatistics: 5245 SDtfs, 3315 SDslu, 2431 SDs, 0 SdLazy, 2974 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 2507 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1911 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40537 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6399 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3926 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...