./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_2a_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_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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 c44a8f5e35fc1ee5ca6d97a995b7f7e9f785e1a5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:48:04,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:48:04,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:48:04,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:48:04,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:48:04,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:48:04,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:48:04,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:48:04,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:48:04,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:48:04,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:48:04,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:48:04,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:48:04,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:48:04,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:48:04,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:48:04,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:48:04,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:48:04,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:48:04,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:48:04,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:48:04,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:48:04,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:48:04,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:48:04,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:48:04,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:48:04,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:48:04,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:48:04,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:48:04,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:48:04,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:48:04,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:48:04,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:48:04,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:48:04,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:48:04,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:48:04,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:48:04,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:48:04,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:48:04,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:48:04,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:48:04,591 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:48:04,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:48:04,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:48:04,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:48:04,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:48:04,627 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:48:04,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:48:04,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:48:04,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:48:04,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:48:04,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:48:04,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:48:04,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:48:04,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:48:04,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:48:04,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:48:04,630 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:48:04,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:48:04,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:48:04,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:48:04,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:48:04,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:48:04,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:48:04,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:48:04,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:48:04,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:48:04,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:48:04,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:48:04,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:48:04,633 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_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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 -> c44a8f5e35fc1ee5ca6d97a995b7f7e9f785e1a5 [2019-11-15 22:48:04,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:48:04,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:48:04,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:48:04,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:48:04,683 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:48:04,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2019-11-15 22:48:04,745 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/data/6e4a3108a/dfd9c35ed14e490aae5e993d82941ee8/FLAGd87e151db [2019-11-15 22:48:05,172 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:48:05,173 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2019-11-15 22:48:05,190 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/data/6e4a3108a/dfd9c35ed14e490aae5e993d82941ee8/FLAGd87e151db [2019-11-15 22:48:05,208 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/data/6e4a3108a/dfd9c35ed14e490aae5e993d82941ee8 [2019-11-15 22:48:05,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:48:05,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:48:05,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:48:05,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:48:05,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:48:05,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:48:05" (1/1) ... [2019-11-15 22:48:05,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516031e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05, skipping insertion in model container [2019-11-15 22:48:05,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:48:05" (1/1) ... [2019-11-15 22:48:05,229 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:48:05,284 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:48:05,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:48:05,575 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:48:05,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:48:05,643 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:48:05,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05 WrapperNode [2019-11-15 22:48:05,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:48:05,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:48:05,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:48:05,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:48:05,652 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:48:05" (1/1) ... [2019-11-15 22:48:05,661 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:48:05" (1/1) ... [2019-11-15 22:48:05,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:48:05,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:48:05,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:48:05,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:48:05,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05" (1/1) ... [2019-11-15 22:48:05,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05" (1/1) ... [2019-11-15 22:48:05,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05" (1/1) ... [2019-11-15 22:48:05,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05" (1/1) ... [2019-11-15 22:48:05,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05" (1/1) ... [2019-11-15 22:48:05,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05" (1/1) ... [2019-11-15 22:48:05,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05" (1/1) ... [2019-11-15 22:48:05,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:48:05,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:48:05,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:48:05,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:48:05,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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:48:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:48:05,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:48:05,990 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:48:06,591 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 22:48:06,592 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 22:48:06,594 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:48:06,594 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:48:06,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:48:06 BoogieIcfgContainer [2019-11-15 22:48:06,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:48:06,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:48:06,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:48:06,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:48:06,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:48:05" (1/3) ... [2019-11-15 22:48:06,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718118b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:48:06, skipping insertion in model container [2019-11-15 22:48:06,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:48:05" (2/3) ... [2019-11-15 22:48:06,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718118b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:48:06, skipping insertion in model container [2019-11-15 22:48:06,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:48:06" (3/3) ... [2019-11-15 22:48:06,605 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a_alt.BV.c.cil.c [2019-11-15 22:48:06,613 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:48:06,620 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:48:06,630 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:48:06,671 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:48:06,671 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:48:06,671 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:48:06,673 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:48:06,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:48:06,673 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:48:06,673 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:48:06,674 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:48:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-15 22:48:06,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:48:06,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:06,702 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:48:06,703 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:06,713 INFO L82 PathProgramCache]: Analyzing trace with hash -91609757, now seen corresponding path program 1 times [2019-11-15 22:48:06,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:06,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199548] [2019-11-15 22:48:06,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:06,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:06,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:06,919 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:48:06,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199548] [2019-11-15 22:48:06,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:06,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:48:06,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698080211] [2019-11-15 22:48:06,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:06,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:06,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:06,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:06,939 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-15 22:48:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:07,247 INFO L93 Difference]: Finished difference Result 316 states and 546 transitions. [2019-11-15 22:48:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:07,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 22:48:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:07,267 INFO L225 Difference]: With dead ends: 316 [2019-11-15 22:48:07,267 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 22:48:07,273 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:48:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 22:48:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2019-11-15 22:48:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 22:48:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2019-11-15 22:48:07,355 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 43 [2019-11-15 22:48:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:07,356 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2019-11-15 22:48:07,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2019-11-15 22:48:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:48:07,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:07,359 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:48:07,359 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:07,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1448029290, now seen corresponding path program 1 times [2019-11-15 22:48:07,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:07,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455646687] [2019-11-15 22:48:07,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:07,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:07,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:07,484 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:48:07,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455646687] [2019-11-15 22:48:07,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:07,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:48:07,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454233011] [2019-11-15 22:48:07,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:07,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:07,487 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand 3 states. [2019-11-15 22:48:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:07,706 INFO L93 Difference]: Finished difference Result 351 states and 564 transitions. [2019-11-15 22:48:07,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:07,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 22:48:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:07,709 INFO L225 Difference]: With dead ends: 351 [2019-11-15 22:48:07,709 INFO L226 Difference]: Without dead ends: 201 [2019-11-15 22:48:07,711 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:48:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-15 22:48:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2019-11-15 22:48:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-15 22:48:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 319 transitions. [2019-11-15 22:48:07,733 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 319 transitions. Word has length 44 [2019-11-15 22:48:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:07,734 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 319 transitions. [2019-11-15 22:48:07,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 319 transitions. [2019-11-15 22:48:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:48:07,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:07,738 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 22:48:07,738 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:07,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2008911458, now seen corresponding path program 1 times [2019-11-15 22:48:07,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:07,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178569665] [2019-11-15 22:48:07,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:07,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:07,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:48:07,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178569665] [2019-11-15 22:48:07,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:07,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:07,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870591410] [2019-11-15 22:48:07,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:07,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:07,853 INFO L87 Difference]: Start difference. First operand 196 states and 319 transitions. Second operand 3 states. [2019-11-15 22:48:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:07,911 INFO L93 Difference]: Finished difference Result 572 states and 934 transitions. [2019-11-15 22:48:07,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:07,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-15 22:48:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:07,916 INFO L225 Difference]: With dead ends: 572 [2019-11-15 22:48:07,916 INFO L226 Difference]: Without dead ends: 383 [2019-11-15 22:48:07,918 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:48:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-15 22:48:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2019-11-15 22:48:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-15 22:48:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 623 transitions. [2019-11-15 22:48:07,948 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 623 transitions. Word has length 59 [2019-11-15 22:48:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:07,948 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 623 transitions. [2019-11-15 22:48:07,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 623 transitions. [2019-11-15 22:48:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 22:48:07,952 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:07,953 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:07,953 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:07,953 INFO L82 PathProgramCache]: Analyzing trace with hash 44999767, now seen corresponding path program 1 times [2019-11-15 22:48:07,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:07,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561976177] [2019-11-15 22:48:07,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:07,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:07,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 22:48:08,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561976177] [2019-11-15 22:48:08,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:08,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:48:08,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638102378] [2019-11-15 22:48:08,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:08,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:08,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:08,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:08,039 INFO L87 Difference]: Start difference. First operand 383 states and 623 transitions. Second operand 3 states. [2019-11-15 22:48:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:08,201 INFO L93 Difference]: Finished difference Result 811 states and 1316 transitions. [2019-11-15 22:48:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:08,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-15 22:48:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:08,205 INFO L225 Difference]: With dead ends: 811 [2019-11-15 22:48:08,205 INFO L226 Difference]: Without dead ends: 435 [2019-11-15 22:48:08,207 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:48:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-15 22:48:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-11-15 22:48:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-15 22:48:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 685 transitions. [2019-11-15 22:48:08,227 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 685 transitions. Word has length 80 [2019-11-15 22:48:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:08,228 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 685 transitions. [2019-11-15 22:48:08,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 685 transitions. [2019-11-15 22:48:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 22:48:08,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:08,231 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:08,231 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash 586802411, now seen corresponding path program 1 times [2019-11-15 22:48:08,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:08,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414890866] [2019-11-15 22:48:08,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:08,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:08,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 22:48:08,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414890866] [2019-11-15 22:48:08,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:08,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:48:08,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755277465] [2019-11-15 22:48:08,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:08,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:08,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:08,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:08,317 INFO L87 Difference]: Start difference. First operand 425 states and 685 transitions. Second operand 3 states. [2019-11-15 22:48:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:08,493 INFO L93 Difference]: Finished difference Result 853 states and 1374 transitions. [2019-11-15 22:48:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:08,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-15 22:48:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:08,496 INFO L225 Difference]: With dead ends: 853 [2019-11-15 22:48:08,496 INFO L226 Difference]: Without dead ends: 435 [2019-11-15 22:48:08,497 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:48:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-15 22:48:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-11-15 22:48:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-15 22:48:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 681 transitions. [2019-11-15 22:48:08,512 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 681 transitions. Word has length 81 [2019-11-15 22:48:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:08,513 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 681 transitions. [2019-11-15 22:48:08,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 681 transitions. [2019-11-15 22:48:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:48:08,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:08,515 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:08,515 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:08,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1514553016, now seen corresponding path program 1 times [2019-11-15 22:48:08,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:08,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922181875] [2019-11-15 22:48:08,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:08,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:08,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:48:08,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922181875] [2019-11-15 22:48:08,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:08,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:08,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749829519] [2019-11-15 22:48:08,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:08,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:08,567 INFO L87 Difference]: Start difference. First operand 425 states and 681 transitions. Second operand 3 states. [2019-11-15 22:48:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:08,739 INFO L93 Difference]: Finished difference Result 971 states and 1575 transitions. [2019-11-15 22:48:08,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:08,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 22:48:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:08,743 INFO L225 Difference]: With dead ends: 971 [2019-11-15 22:48:08,743 INFO L226 Difference]: Without dead ends: 553 [2019-11-15 22:48:08,744 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:48:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-15 22:48:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 543. [2019-11-15 22:48:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-11-15 22:48:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 797 transitions. [2019-11-15 22:48:08,762 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 797 transitions. Word has length 96 [2019-11-15 22:48:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:08,763 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 797 transitions. [2019-11-15 22:48:08,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 797 transitions. [2019-11-15 22:48:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:48:08,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:08,765 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:08,766 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1948282102, now seen corresponding path program 1 times [2019-11-15 22:48:08,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:08,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189902097] [2019-11-15 22:48:08,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:08,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:08,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:48:08,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189902097] [2019-11-15 22:48:08,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:08,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:08,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328676949] [2019-11-15 22:48:08,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:08,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:08,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:08,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:08,820 INFO L87 Difference]: Start difference. First operand 543 states and 797 transitions. Second operand 3 states. [2019-11-15 22:48:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:08,994 INFO L93 Difference]: Finished difference Result 1167 states and 1733 transitions. [2019-11-15 22:48:08,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:08,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 22:48:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:08,998 INFO L225 Difference]: With dead ends: 1167 [2019-11-15 22:48:08,998 INFO L226 Difference]: Without dead ends: 631 [2019-11-15 22:48:08,999 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:48:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-15 22:48:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 605. [2019-11-15 22:48:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-11-15 22:48:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 885 transitions. [2019-11-15 22:48:09,019 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 885 transitions. Word has length 96 [2019-11-15 22:48:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:09,019 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 885 transitions. [2019-11-15 22:48:09,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 885 transitions. [2019-11-15 22:48:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 22:48:09,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:09,022 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:48:09,022 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:09,022 INFO L82 PathProgramCache]: Analyzing trace with hash 564782516, now seen corresponding path program 1 times [2019-11-15 22:48:09,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:09,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917313311] [2019-11-15 22:48:09,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:09,077 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:48:09,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917313311] [2019-11-15 22:48:09,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:09,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:09,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763980069] [2019-11-15 22:48:09,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:09,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:09,079 INFO L87 Difference]: Start difference. First operand 605 states and 885 transitions. Second operand 3 states. [2019-11-15 22:48:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:09,117 INFO L93 Difference]: Finished difference Result 905 states and 1324 transitions. [2019-11-15 22:48:09,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:09,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-15 22:48:09,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:09,123 INFO L225 Difference]: With dead ends: 905 [2019-11-15 22:48:09,123 INFO L226 Difference]: Without dead ends: 903 [2019-11-15 22:48:09,124 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:48:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-15 22:48:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-11-15 22:48:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-11-15 22:48:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1322 transitions. [2019-11-15 22:48:09,149 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1322 transitions. Word has length 120 [2019-11-15 22:48:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:09,150 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1322 transitions. [2019-11-15 22:48:09,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1322 transitions. [2019-11-15 22:48:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 22:48:09,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:09,154 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:09,154 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:09,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:09,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1174075643, now seen corresponding path program 1 times [2019-11-15 22:48:09,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:09,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823394068] [2019-11-15 22:48:09,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-15 22:48:09,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823394068] [2019-11-15 22:48:09,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:09,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:09,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906051424] [2019-11-15 22:48:09,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:09,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:09,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:09,214 INFO L87 Difference]: Start difference. First operand 903 states and 1322 transitions. Second operand 3 states. [2019-11-15 22:48:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:09,360 INFO L93 Difference]: Finished difference Result 1877 states and 2732 transitions. [2019-11-15 22:48:09,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:09,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-15 22:48:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:09,366 INFO L225 Difference]: With dead ends: 1877 [2019-11-15 22:48:09,366 INFO L226 Difference]: Without dead ends: 981 [2019-11-15 22:48:09,368 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:48:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-11-15 22:48:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 972. [2019-11-15 22:48:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-15 22:48:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1406 transitions. [2019-11-15 22:48:09,396 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1406 transitions. Word has length 184 [2019-11-15 22:48:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:09,397 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1406 transitions. [2019-11-15 22:48:09,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1406 transitions. [2019-11-15 22:48:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 22:48:09,402 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:09,403 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:09,403 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:09,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:09,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1179429289, now seen corresponding path program 1 times [2019-11-15 22:48:09,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:09,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638834618] [2019-11-15 22:48:09,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-15 22:48:09,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638834618] [2019-11-15 22:48:09,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:09,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:09,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210724449] [2019-11-15 22:48:09,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:09,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:09,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:09,510 INFO L87 Difference]: Start difference. First operand 972 states and 1406 transitions. Second operand 3 states. [2019-11-15 22:48:09,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:09,652 INFO L93 Difference]: Finished difference Result 2048 states and 2960 transitions. [2019-11-15 22:48:09,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:09,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-15 22:48:09,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:09,659 INFO L225 Difference]: With dead ends: 2048 [2019-11-15 22:48:09,659 INFO L226 Difference]: Without dead ends: 1083 [2019-11-15 22:48:09,661 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:48:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-15 22:48:09,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1047. [2019-11-15 22:48:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-11-15 22:48:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1496 transitions. [2019-11-15 22:48:09,692 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1496 transitions. Word has length 204 [2019-11-15 22:48:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:09,692 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 1496 transitions. [2019-11-15 22:48:09,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1496 transitions. [2019-11-15 22:48:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 22:48:09,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:09,696 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:09,697 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1179962115, now seen corresponding path program 1 times [2019-11-15 22:48:09,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:09,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974053498] [2019-11-15 22:48:09,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-11-15 22:48:09,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974053498] [2019-11-15 22:48:09,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:09,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:09,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449204526] [2019-11-15 22:48:09,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:09,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:09,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:09,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:09,769 INFO L87 Difference]: Start difference. First operand 1047 states and 1496 transitions. Second operand 3 states. [2019-11-15 22:48:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:09,813 INFO L93 Difference]: Finished difference Result 3109 states and 4430 transitions. [2019-11-15 22:48:09,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:09,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-15 22:48:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:09,825 INFO L225 Difference]: With dead ends: 3109 [2019-11-15 22:48:09,826 INFO L226 Difference]: Without dead ends: 2069 [2019-11-15 22:48:09,827 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:48:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-11-15 22:48:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1050. [2019-11-15 22:48:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-11-15 22:48:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1499 transitions. [2019-11-15 22:48:09,870 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1499 transitions. Word has length 230 [2019-11-15 22:48:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:09,870 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 1499 transitions. [2019-11-15 22:48:09,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1499 transitions. [2019-11-15 22:48:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 22:48:09,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:09,875 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:09,875 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:09,876 INFO L82 PathProgramCache]: Analyzing trace with hash -150020643, now seen corresponding path program 1 times [2019-11-15 22:48:09,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:09,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255373886] [2019-11-15 22:48:09,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-11-15 22:48:09,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255373886] [2019-11-15 22:48:09,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:09,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:09,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553250239] [2019-11-15 22:48:09,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:09,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:09,956 INFO L87 Difference]: Start difference. First operand 1050 states and 1499 transitions. Second operand 3 states. [2019-11-15 22:48:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:10,105 INFO L93 Difference]: Finished difference Result 2195 states and 3134 transitions. [2019-11-15 22:48:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:10,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-15 22:48:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:10,112 INFO L225 Difference]: With dead ends: 2195 [2019-11-15 22:48:10,113 INFO L226 Difference]: Without dead ends: 1152 [2019-11-15 22:48:10,115 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:48:10,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-11-15 22:48:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1131. [2019-11-15 22:48:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-11-15 22:48:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1595 transitions. [2019-11-15 22:48:10,163 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1595 transitions. Word has length 230 [2019-11-15 22:48:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:10,164 INFO L462 AbstractCegarLoop]: Abstraction has 1131 states and 1595 transitions. [2019-11-15 22:48:10,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1595 transitions. [2019-11-15 22:48:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-15 22:48:10,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:10,169 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:10,170 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash -336843366, now seen corresponding path program 1 times [2019-11-15 22:48:10,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:10,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424635326] [2019-11-15 22:48:10,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:10,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:10,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-11-15 22:48:10,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424635326] [2019-11-15 22:48:10,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:10,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:10,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030020381] [2019-11-15 22:48:10,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:10,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:10,333 INFO L87 Difference]: Start difference. First operand 1131 states and 1595 transitions. Second operand 3 states. [2019-11-15 22:48:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:10,402 INFO L93 Difference]: Finished difference Result 3373 states and 4754 transitions. [2019-11-15 22:48:10,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:10,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-15 22:48:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:10,416 INFO L225 Difference]: With dead ends: 3373 [2019-11-15 22:48:10,416 INFO L226 Difference]: Without dead ends: 2249 [2019-11-15 22:48:10,418 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:48:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-15 22:48:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2247. [2019-11-15 22:48:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2019-11-15 22:48:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3163 transitions. [2019-11-15 22:48:10,491 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3163 transitions. Word has length 231 [2019-11-15 22:48:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:10,492 INFO L462 AbstractCegarLoop]: Abstraction has 2247 states and 3163 transitions. [2019-11-15 22:48:10,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3163 transitions. [2019-11-15 22:48:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 22:48:10,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:10,498 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:10,499 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:10,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1934345498, now seen corresponding path program 1 times [2019-11-15 22:48:10,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:10,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743909494] [2019-11-15 22:48:10,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:10,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:10,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-15 22:48:10,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743909494] [2019-11-15 22:48:10,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:10,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:10,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934436165] [2019-11-15 22:48:10,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:10,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:10,597 INFO L87 Difference]: Start difference. First operand 2247 states and 3163 transitions. Second operand 3 states. [2019-11-15 22:48:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:10,799 INFO L93 Difference]: Finished difference Result 4733 states and 6735 transitions. [2019-11-15 22:48:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:10,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-15 22:48:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:10,813 INFO L225 Difference]: With dead ends: 4733 [2019-11-15 22:48:10,813 INFO L226 Difference]: Without dead ends: 2433 [2019-11-15 22:48:10,817 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:48:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2019-11-15 22:48:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2019-11-15 22:48:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-11-15 22:48:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3379 transitions. [2019-11-15 22:48:10,896 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3379 transitions. Word has length 232 [2019-11-15 22:48:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:10,896 INFO L462 AbstractCegarLoop]: Abstraction has 2433 states and 3379 transitions. [2019-11-15 22:48:10,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3379 transitions. [2019-11-15 22:48:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-15 22:48:10,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:10,903 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:10,903 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash -462203708, now seen corresponding path program 1 times [2019-11-15 22:48:10,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:10,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633643876] [2019-11-15 22:48:10,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:10,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:10,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-15 22:48:11,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633643876] [2019-11-15 22:48:11,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344555756] [2019-11-15 22:48:11,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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:48:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:11,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:48:11,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-15 22:48:11,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:48:11,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:48:11,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722023863] [2019-11-15 22:48:11,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:11,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:48:11,268 INFO L87 Difference]: Start difference. First operand 2433 states and 3379 transitions. Second operand 3 states. [2019-11-15 22:48:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:11,355 INFO L93 Difference]: Finished difference Result 5667 states and 7870 transitions. [2019-11-15 22:48:11,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:11,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-15 22:48:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:11,373 INFO L225 Difference]: With dead ends: 5667 [2019-11-15 22:48:11,374 INFO L226 Difference]: Without dead ends: 3241 [2019-11-15 22:48:11,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:48:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2019-11-15 22:48:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3241. [2019-11-15 22:48:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2019-11-15 22:48:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4500 transitions. [2019-11-15 22:48:11,496 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4500 transitions. Word has length 244 [2019-11-15 22:48:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:11,497 INFO L462 AbstractCegarLoop]: Abstraction has 3241 states and 4500 transitions. [2019-11-15 22:48:11,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4500 transitions. [2019-11-15 22:48:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 22:48:11,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:11,506 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 22:48:11,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:48:11,711 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash 464017511, now seen corresponding path program 1 times [2019-11-15 22:48:11,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:11,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184496259] [2019-11-15 22:48:11,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:11,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:11,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:48:11,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184496259] [2019-11-15 22:48:11,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979604111] [2019-11-15 22:48:11,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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:48:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:11,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:48:11,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:48:12,005 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:48:12,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:48:12,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169130619] [2019-11-15 22:48:12,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:48:12,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:12,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:48:12,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:48:12,007 INFO L87 Difference]: Start difference. First operand 3241 states and 4500 transitions. Second operand 4 states. [2019-11-15 22:48:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:12,425 INFO L93 Difference]: Finished difference Result 8229 states and 11374 transitions. [2019-11-15 22:48:12,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:48:12,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-15 22:48:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:12,451 INFO L225 Difference]: With dead ends: 8229 [2019-11-15 22:48:12,452 INFO L226 Difference]: Without dead ends: 4995 [2019-11-15 22:48:12,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 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:48:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2019-11-15 22:48:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4161. [2019-11-15 22:48:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4161 states. [2019-11-15 22:48:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 5572 transitions. [2019-11-15 22:48:12,592 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 5572 transitions. Word has length 252 [2019-11-15 22:48:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:12,592 INFO L462 AbstractCegarLoop]: Abstraction has 4161 states and 5572 transitions. [2019-11-15 22:48:12,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:48:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 5572 transitions. [2019-11-15 22:48:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 22:48:12,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:12,602 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 22:48:12,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:48:12,815 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash 752836901, now seen corresponding path program 1 times [2019-11-15 22:48:12,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:12,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619106201] [2019-11-15 22:48:12,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:12,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:12,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 22:48:12,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619106201] [2019-11-15 22:48:12,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:12,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:12,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303250044] [2019-11-15 22:48:12,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:12,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:12,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:12,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:12,922 INFO L87 Difference]: Start difference. First operand 4161 states and 5572 transitions. Second operand 3 states. [2019-11-15 22:48:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:13,073 INFO L93 Difference]: Finished difference Result 11621 states and 15694 transitions. [2019-11-15 22:48:13,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:13,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-15 22:48:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:13,108 INFO L225 Difference]: With dead ends: 11621 [2019-11-15 22:48:13,108 INFO L226 Difference]: Without dead ends: 5141 [2019-11-15 22:48:13,116 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:48:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2019-11-15 22:48:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 4886. [2019-11-15 22:48:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2019-11-15 22:48:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 6668 transitions. [2019-11-15 22:48:13,269 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 6668 transitions. Word has length 252 [2019-11-15 22:48:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:13,269 INFO L462 AbstractCegarLoop]: Abstraction has 4886 states and 6668 transitions. [2019-11-15 22:48:13,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 6668 transitions. [2019-11-15 22:48:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-15 22:48:13,280 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:13,280 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 22:48:13,281 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:13,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:13,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1551518133, now seen corresponding path program 1 times [2019-11-15 22:48:13,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:13,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888708250] [2019-11-15 22:48:13,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:13,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:13,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2019-11-15 22:48:13,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888708250] [2019-11-15 22:48:13,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:13,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:13,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409439763] [2019-11-15 22:48:13,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:13,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:13,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:13,447 INFO L87 Difference]: Start difference. First operand 4886 states and 6668 transitions. Second operand 3 states. [2019-11-15 22:48:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:13,672 INFO L93 Difference]: Finished difference Result 10137 states and 13841 transitions. [2019-11-15 22:48:13,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:13,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-15 22:48:13,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:13,689 INFO L225 Difference]: With dead ends: 10137 [2019-11-15 22:48:13,690 INFO L226 Difference]: Without dead ends: 5258 [2019-11-15 22:48:13,696 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:48:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-11-15 22:48:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5234. [2019-11-15 22:48:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2019-11-15 22:48:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7076 transitions. [2019-11-15 22:48:13,838 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7076 transitions. Word has length 321 [2019-11-15 22:48:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:13,839 INFO L462 AbstractCegarLoop]: Abstraction has 5234 states and 7076 transitions. [2019-11-15 22:48:13,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7076 transitions. [2019-11-15 22:48:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-11-15 22:48:13,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:13,851 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 22:48:13,852 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash -16053374, now seen corresponding path program 1 times [2019-11-15 22:48:13,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:13,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105384684] [2019-11-15 22:48:13,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:13,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:13,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-15 22:48:13,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105384684] [2019-11-15 22:48:13,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33008549] [2019-11-15 22:48:13,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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:48:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:14,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:48:14,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2019-11-15 22:48:14,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:48:14,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:48:14,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567693139] [2019-11-15 22:48:14,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:14,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:14,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:14,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:48:14,288 INFO L87 Difference]: Start difference. First operand 5234 states and 7076 transitions. Second operand 3 states. [2019-11-15 22:48:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:14,387 INFO L93 Difference]: Finished difference Result 6046 states and 8192 transitions. [2019-11-15 22:48:14,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:14,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2019-11-15 22:48:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:14,398 INFO L225 Difference]: With dead ends: 6046 [2019-11-15 22:48:14,398 INFO L226 Difference]: Without dead ends: 4563 [2019-11-15 22:48:14,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:48:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2019-11-15 22:48:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 3753. [2019-11-15 22:48:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2019-11-15 22:48:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 5068 transitions. [2019-11-15 22:48:14,538 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 5068 transitions. Word has length 354 [2019-11-15 22:48:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:14,539 INFO L462 AbstractCegarLoop]: Abstraction has 3753 states and 5068 transitions. [2019-11-15 22:48:14,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 5068 transitions. [2019-11-15 22:48:14,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-11-15 22:48:14,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:14,553 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:14,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:48:14,804 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:14,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:14,805 INFO L82 PathProgramCache]: Analyzing trace with hash -235980636, now seen corresponding path program 1 times [2019-11-15 22:48:14,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:14,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495511608] [2019-11-15 22:48:14,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:14,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:14,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2019-11-15 22:48:14,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495511608] [2019-11-15 22:48:14,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902784654] [2019-11-15 22:48:14,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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:48:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:15,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:48:15,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2019-11-15 22:48:15,226 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:48:15,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:48:15,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330689766] [2019-11-15 22:48:15,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:48:15,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:48:15,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:48:15,229 INFO L87 Difference]: Start difference. First operand 3753 states and 5068 transitions. Second operand 4 states. [2019-11-15 22:48:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:15,700 INFO L93 Difference]: Finished difference Result 8431 states and 11397 transitions. [2019-11-15 22:48:15,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:48:15,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 416 [2019-11-15 22:48:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:15,709 INFO L225 Difference]: With dead ends: 8431 [2019-11-15 22:48:15,710 INFO L226 Difference]: Without dead ends: 4516 [2019-11-15 22:48:15,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 418 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:48:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2019-11-15 22:48:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 3782. [2019-11-15 22:48:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-11-15 22:48:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5040 transitions. [2019-11-15 22:48:15,830 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5040 transitions. Word has length 416 [2019-11-15 22:48:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:15,831 INFO L462 AbstractCegarLoop]: Abstraction has 3782 states and 5040 transitions. [2019-11-15 22:48:15,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:48:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5040 transitions. [2019-11-15 22:48:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-11-15 22:48:15,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:15,846 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:48:16,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:48:16,050 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:16,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1952122078, now seen corresponding path program 1 times [2019-11-15 22:48:16,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:16,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750180490] [2019-11-15 22:48:16,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:16,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:16,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 1354 proven. 13 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2019-11-15 22:48:16,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750180490] [2019-11-15 22:48:16,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869147290] [2019-11-15 22:48:16,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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:48:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:16,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:48:16,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 1354 proven. 13 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2019-11-15 22:48:16,580 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:48:16,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:48:16,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602359429] [2019-11-15 22:48:16,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:48:16,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:48:16,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:48:16,583 INFO L87 Difference]: Start difference. First operand 3782 states and 5040 transitions. Second operand 4 states. [2019-11-15 22:48:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:17,037 INFO L93 Difference]: Finished difference Result 11074 states and 14738 transitions. [2019-11-15 22:48:17,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:48:17,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 448 [2019-11-15 22:48:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:17,052 INFO L225 Difference]: With dead ends: 11074 [2019-11-15 22:48:17,052 INFO L226 Difference]: Without dead ends: 7488 [2019-11-15 22:48:17,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 450 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:48:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7488 states. [2019-11-15 22:48:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7488 to 5198. [2019-11-15 22:48:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5198 states. [2019-11-15 22:48:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 6920 transitions. [2019-11-15 22:48:17,259 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 6920 transitions. Word has length 448 [2019-11-15 22:48:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:17,259 INFO L462 AbstractCegarLoop]: Abstraction has 5198 states and 6920 transitions. [2019-11-15 22:48:17,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:48:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 6920 transitions. [2019-11-15 22:48:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-15 22:48:17,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:17,281 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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:48:17,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:48:17,486 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash -671064672, now seen corresponding path program 1 times [2019-11-15 22:48:17,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:17,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094954125] [2019-11-15 22:48:17,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:17,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:17,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2900 backedges. 1662 proven. 0 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2019-11-15 22:48:17,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094954125] [2019-11-15 22:48:17,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:17,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:17,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609578313] [2019-11-15 22:48:17,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:17,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:17,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:17,781 INFO L87 Difference]: Start difference. First operand 5198 states and 6920 transitions. Second operand 3 states. [2019-11-15 22:48:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:18,017 INFO L93 Difference]: Finished difference Result 11001 states and 14577 transitions. [2019-11-15 22:48:18,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:18,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-15 22:48:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:18,029 INFO L225 Difference]: With dead ends: 11001 [2019-11-15 22:48:18,029 INFO L226 Difference]: Without dead ends: 5810 [2019-11-15 22:48:18,036 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:48:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2019-11-15 22:48:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 5776. [2019-11-15 22:48:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5776 states. [2019-11-15 22:48:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 7583 transitions. [2019-11-15 22:48:18,202 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 7583 transitions. Word has length 493 [2019-11-15 22:48:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:18,202 INFO L462 AbstractCegarLoop]: Abstraction has 5776 states and 7583 transitions. [2019-11-15 22:48:18,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 7583 transitions. [2019-11-15 22:48:18,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-11-15 22:48:18,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:18,222 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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] [2019-11-15 22:48:18,222 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:18,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1196437202, now seen corresponding path program 1 times [2019-11-15 22:48:18,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:18,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667497480] [2019-11-15 22:48:18,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:18,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:18,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1660 proven. 77 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2019-11-15 22:48:18,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667497480] [2019-11-15 22:48:18,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47674469] [2019-11-15 22:48:18,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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:48:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:18,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:48:18,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-11-15 22:48:18,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:48:18,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:48:18,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884533741] [2019-11-15 22:48:18,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:18,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:18,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:48:18,784 INFO L87 Difference]: Start difference. First operand 5776 states and 7583 transitions. Second operand 3 states. [2019-11-15 22:48:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:19,054 INFO L93 Difference]: Finished difference Result 11733 states and 15463 transitions. [2019-11-15 22:48:19,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:19,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-11-15 22:48:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:19,065 INFO L225 Difference]: With dead ends: 11733 [2019-11-15 22:48:19,065 INFO L226 Difference]: Without dead ends: 5964 [2019-11-15 22:48:19,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:48:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-11-15 22:48:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5864. [2019-11-15 22:48:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5864 states. [2019-11-15 22:48:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 7707 transitions. [2019-11-15 22:48:19,223 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 7707 transitions. Word has length 508 [2019-11-15 22:48:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:19,224 INFO L462 AbstractCegarLoop]: Abstraction has 5864 states and 7707 transitions. [2019-11-15 22:48:19,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 7707 transitions. [2019-11-15 22:48:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-11-15 22:48:19,245 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:19,245 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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] [2019-11-15 22:48:19,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:48:19,450 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:19,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1496383928, now seen corresponding path program 1 times [2019-11-15 22:48:19,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:19,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137476058] [2019-11-15 22:48:19,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:19,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:19,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1744 proven. 206 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2019-11-15 22:48:20,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137476058] [2019-11-15 22:48:20,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152558846] [2019-11-15 22:48:20,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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:48:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:20,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:48:20,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:20,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:48:20,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:48:20,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:48:20,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:48:21,426 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse0 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= c_ULTIMATE.start_ssl3_accept_~s__state~0 .cse0) (<= .cse0 2147483647) (< 2147483647 .cse0)))) (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse1 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= c_ULTIMATE.start_ssl3_accept_~s__state~0 .cse1) (<= .cse1 2147483647) (<= .cse1 8496)))) (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse2 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= (+ c_ULTIMATE.start_ssl3_accept_~s__state~0 4294967296) .cse2) (< 2147483647 .cse2)))) (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (and (<= (+ c_ULTIMATE.start_ssl3_accept_~s__state~0 4294967296) .cse3) (< 2147483647 .cse3) (<= .cse3 8496))))) is different from true [2019-11-15 22:48:23,201 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 50 DAG size of output: 16 [2019-11-15 22:48:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 232 refuted. 0 times theorem prover too weak. 1173 trivial. 7 not checked. [2019-11-15 22:48:23,867 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:48:23,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-11-15 22:48:23,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375231281] [2019-11-15 22:48:23,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:48:23,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:23,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:48:23,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2019-11-15 22:48:23,871 INFO L87 Difference]: Start difference. First operand 5864 states and 7707 transitions. Second operand 9 states. [2019-11-15 22:48:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:30,077 INFO L93 Difference]: Finished difference Result 23651 states and 30855 transitions. [2019-11-15 22:48:30,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:48:30,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 512 [2019-11-15 22:48:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:30,107 INFO L225 Difference]: With dead ends: 23651 [2019-11-15 22:48:30,108 INFO L226 Difference]: Without dead ends: 17094 [2019-11-15 22:48:30,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 515 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=68, Invalid=145, Unknown=1, NotChecked=26, Total=240 [2019-11-15 22:48:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17094 states. [2019-11-15 22:48:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17094 to 16029. [2019-11-15 22:48:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16029 states. [2019-11-15 22:48:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16029 states to 16029 states and 20135 transitions. [2019-11-15 22:48:30,592 INFO L78 Accepts]: Start accepts. Automaton has 16029 states and 20135 transitions. Word has length 512 [2019-11-15 22:48:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:30,593 INFO L462 AbstractCegarLoop]: Abstraction has 16029 states and 20135 transitions. [2019-11-15 22:48:30,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:48:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 16029 states and 20135 transitions. [2019-11-15 22:48:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-11-15 22:48:30,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:30,628 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 5, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:30,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:48:30,834 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash 76731436, now seen corresponding path program 1 times [2019-11-15 22:48:30,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:30,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870059453] [2019-11-15 22:48:30,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:30,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:30,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3360 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 3006 trivial. 0 not checked. [2019-11-15 22:48:31,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870059453] [2019-11-15 22:48:31,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:31,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:48:31,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501965010] [2019-11-15 22:48:31,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:31,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:31,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:31,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:31,039 INFO L87 Difference]: Start difference. First operand 16029 states and 20135 transitions. Second operand 3 states. [2019-11-15 22:48:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:31,468 INFO L93 Difference]: Finished difference Result 33490 states and 41898 transitions. [2019-11-15 22:48:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:31,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 524 [2019-11-15 22:48:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:31,492 INFO L225 Difference]: With dead ends: 33490 [2019-11-15 22:48:31,493 INFO L226 Difference]: Without dead ends: 15881 [2019-11-15 22:48:31,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15881 states. [2019-11-15 22:48:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15881 to 15136. [2019-11-15 22:48:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-15 22:48:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18911 transitions. [2019-11-15 22:48:31,881 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18911 transitions. Word has length 524 [2019-11-15 22:48:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:31,881 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18911 transitions. [2019-11-15 22:48:31,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18911 transitions. [2019-11-15 22:48:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-11-15 22:48:31,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:31,905 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 5, 4, 4, 4, 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, 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:48:31,905 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:31,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1215376266, now seen corresponding path program 1 times [2019-11-15 22:48:31,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:31,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318568183] [2019-11-15 22:48:31,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:31,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:31,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3548 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-11-15 22:48:32,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318568183] [2019-11-15 22:48:32,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:32,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:48:32,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293098140] [2019-11-15 22:48:32,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:32,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:32,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:32,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:32,392 INFO L87 Difference]: Start difference. First operand 15136 states and 18911 transitions. Second operand 3 states. [2019-11-15 22:48:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:32,801 INFO L93 Difference]: Finished difference Result 29994 states and 37432 transitions. [2019-11-15 22:48:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:32,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2019-11-15 22:48:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:32,827 INFO L225 Difference]: With dead ends: 29994 [2019-11-15 22:48:32,827 INFO L226 Difference]: Without dead ends: 15184 [2019-11-15 22:48:32,836 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:48:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2019-11-15 22:48:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15136. [2019-11-15 22:48:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-15 22:48:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18868 transitions. [2019-11-15 22:48:33,209 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18868 transitions. Word has length 536 [2019-11-15 22:48:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:33,210 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18868 transitions. [2019-11-15 22:48:33,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18868 transitions. [2019-11-15 22:48:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-15 22:48:33,226 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:33,227 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 5, 4, 4, 4, 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, 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:48:33,227 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:33,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:33,227 INFO L82 PathProgramCache]: Analyzing trace with hash -943603990, now seen corresponding path program 1 times [2019-11-15 22:48:33,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:33,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384927833] [2019-11-15 22:48:33,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:33,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:33,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2019-11-15 22:48:33,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384927833] [2019-11-15 22:48:33,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:33,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:48:33,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413125709] [2019-11-15 22:48:33,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:33,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:33,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:33,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:33,422 INFO L87 Difference]: Start difference. First operand 15136 states and 18868 transitions. Second operand 3 states. [2019-11-15 22:48:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:33,798 INFO L93 Difference]: Finished difference Result 29994 states and 37349 transitions. [2019-11-15 22:48:33,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:33,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-11-15 22:48:33,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:33,821 INFO L225 Difference]: With dead ends: 29994 [2019-11-15 22:48:33,821 INFO L226 Difference]: Without dead ends: 15184 [2019-11-15 22:48:33,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:48:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2019-11-15 22:48:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15136. [2019-11-15 22:48:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-15 22:48:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18825 transitions. [2019-11-15 22:48:34,191 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18825 transitions. Word has length 537 [2019-11-15 22:48:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:34,191 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18825 transitions. [2019-11-15 22:48:34,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18825 transitions. [2019-11-15 22:48:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-11-15 22:48:34,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:34,208 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:34,208 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash 780560607, now seen corresponding path program 1 times [2019-11-15 22:48:34,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:34,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463567428] [2019-11-15 22:48:34,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:34,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:34,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3937 backedges. 2204 proven. 0 refuted. 0 times theorem prover too weak. 1733 trivial. 0 not checked. [2019-11-15 22:48:34,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463567428] [2019-11-15 22:48:34,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:34,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:34,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872269551] [2019-11-15 22:48:34,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:48:34,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:34,582 INFO L87 Difference]: Start difference. First operand 15136 states and 18825 transitions. Second operand 3 states. [2019-11-15 22:48:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:34,987 INFO L93 Difference]: Finished difference Result 30231 states and 37579 transitions. [2019-11-15 22:48:34,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:34,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 580 [2019-11-15 22:48:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:35,011 INFO L225 Difference]: With dead ends: 30231 [2019-11-15 22:48:35,011 INFO L226 Difference]: Without dead ends: 15114 [2019-11-15 22:48:35,021 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:48:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15114 states. [2019-11-15 22:48:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15114 to 13798. [2019-11-15 22:48:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13798 states. [2019-11-15 22:48:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13798 states to 13798 states and 17082 transitions. [2019-11-15 22:48:35,370 INFO L78 Accepts]: Start accepts. Automaton has 13798 states and 17082 transitions. Word has length 580 [2019-11-15 22:48:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:35,371 INFO L462 AbstractCegarLoop]: Abstraction has 13798 states and 17082 transitions. [2019-11-15 22:48:35,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:48:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 13798 states and 17082 transitions. [2019-11-15 22:48:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-11-15 22:48:35,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:48:35,386 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:48:35,386 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:48:35,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:35,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1763345373, now seen corresponding path program 2 times [2019-11-15 22:48:35,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:35,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786004542] [2019-11-15 22:48:35,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:35,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:35,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2019-11-15 22:48:35,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786004542] [2019-11-15 22:48:35,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220299624] [2019-11-15 22:48:35,639 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/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:48:35,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:48:35,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:48:35,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:48:35,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2019-11-15 22:48:36,091 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:48:36,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:48:36,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061132282] [2019-11-15 22:48:36,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:48:36,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:36,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:48:36,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:48:36,094 INFO L87 Difference]: Start difference. First operand 13798 states and 17082 transitions. Second operand 4 states. [2019-11-15 22:48:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:36,522 INFO L93 Difference]: Finished difference Result 19952 states and 24719 transitions. [2019-11-15 22:48:36,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:48:36,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 582 [2019-11-15 22:48:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:48:36,523 INFO L225 Difference]: With dead ends: 19952 [2019-11-15 22:48:36,523 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:48:36,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 584 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:48:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:48:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:48:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:48:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:48:36,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 582 [2019-11-15 22:48:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:48:36,533 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:48:36,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:48:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:48:36,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:48:36,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:48:36,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:48:37,152 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 117 [2019-11-15 22:48:39,064 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 737 DAG size of output: 430 [2019-11-15 22:48:40,607 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 738 DAG size of output: 431 [2019-11-15 22:48:41,058 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 43 [2019-11-15 22:48:49,937 WARN L191 SmtUtils]: Spent 8.88 s on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2019-11-15 22:48:56,739 WARN L191 SmtUtils]: Spent 6.80 s on a formula simplification. DAG size of input: 114 DAG size of output: 42 [2019-11-15 22:48:57,013 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 44 [2019-11-15 22:48:57,279 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-15 22:48:57,491 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 33 [2019-11-15 22:48:57,706 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2019-11-15 22:48:58,060 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 38 [2019-11-15 22:49:01,543 WARN L191 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 120 DAG size of output: 54 [2019-11-15 22:49:04,777 WARN L191 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 362 DAG size of output: 119 [2019-11-15 22:49:05,046 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 38 [2019-11-15 22:49:05,247 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 37 [2019-11-15 22:49:05,537 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 39 [2019-11-15 22:49:05,788 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-15 22:49:06,036 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-15 22:49:06,253 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 41 [2019-11-15 22:49:06,470 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2019-11-15 22:49:06,701 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 53 [2019-11-15 22:49:10,291 WARN L191 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 363 DAG size of output: 116 [2019-11-15 22:49:10,566 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 39 [2019-11-15 22:49:10,568 INFO L439 ceAbstractionStarter]: At program point L168(lines 167 605) the Hoare annotation is: (let ((.cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse7 (not .cse5)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse4 (let ((.cse9 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse9) (<= .cse9 8496))))) (or (and .cse0 .cse1 .cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (and (and .cse3 .cse2 .cse4 .cse5) .cse6) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3 .cse2 .cse7) (and .cse2 .cse0 .cse4) (and .cse0 .cse6 .cse2) (and .cse8 .cse2 .cse7) (and .cse8 .cse1 .cse2 .cse4)))) [2019-11-15 22:49:10,568 INFO L439 ceAbstractionStarter]: At program point L135(lines 128 618) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse3 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse7 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse7 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse7) (<= .cse7 2147483647))))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 (let ((.cse5 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse5) (<= .cse5 8496)))) .cse6) (and .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse0 .cse1 .cse3 .cse6))) [2019-11-15 22:49:10,568 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 22:49:10,569 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 635) no Hoare annotation was computed. [2019-11-15 22:49:10,569 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 593) no Hoare annotation was computed. [2019-11-15 22:49:10,569 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 604) no Hoare annotation was computed. [2019-11-15 22:49:10,569 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 615) no Hoare annotation was computed. [2019-11-15 22:49:10,569 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 626) no Hoare annotation was computed. [2019-11-15 22:49:10,569 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 669) no Hoare annotation was computed. [2019-11-15 22:49:10,569 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-11-15 22:49:10,569 INFO L439 ceAbstractionStarter]: At program point L204(lines 200 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (let ((.cse2 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse2) (<= .cse2 8496)))))) [2019-11-15 22:49:10,569 INFO L439 ceAbstractionStarter]: At program point L105(lines 104 626) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:49:10,569 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 480) no Hoare annotation was computed. [2019-11-15 22:49:10,570 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 440) no Hoare annotation was computed. [2019-11-15 22:49:10,570 INFO L439 ceAbstractionStarter]: At program point L370(lines 353 388) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 .cse1 (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-15 22:49:10,570 INFO L439 ceAbstractionStarter]: At program point L404(lines 395 426) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-15 22:49:10,570 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 244) no Hoare annotation was computed. [2019-11-15 22:49:10,570 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 592) no Hoare annotation was computed. [2019-11-15 22:49:10,570 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 603) no Hoare annotation was computed. [2019-11-15 22:49:10,570 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 614) no Hoare annotation was computed. [2019-11-15 22:49:10,570 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 625) no Hoare annotation was computed. [2019-11-15 22:49:10,571 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 376) no Hoare annotation was computed. [2019-11-15 22:49:10,571 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 592) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:49:10,571 INFO L439 ceAbstractionStarter]: At program point L174(lines 170 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)))) (or (and .cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1))) (and .cse0 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))))) [2019-11-15 22:49:10,571 INFO L439 ceAbstractionStarter]: At program point L141(lines 137 615) the Hoare annotation is: (let ((.cse8 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (let ((.cse7 (< 2147483647 .cse8))) (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (or (<= .cse8 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= .cse8 (+ ULTIMATE.start_ssl3_accept_~s__state~0 4294967296)) .cse7))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse4 (or .cse7 (<= .cse8 8496)))) (or (and .cse0 (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4) .cse5) (and .cse6 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse5 (and .cse1 .cse2 (and .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3) .cse4)))))) [2019-11-15 22:49:10,571 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 83) no Hoare annotation was computed. [2019-11-15 22:49:10,571 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 412) no Hoare annotation was computed. [2019-11-15 22:49:10,571 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 582) no Hoare annotation was computed. [2019-11-15 22:49:10,571 INFO L443 ceAbstractionStarter]: For program point L572-1(lines 572 582) no Hoare annotation was computed. [2019-11-15 22:49:10,571 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 477) no Hoare annotation was computed. [2019-11-15 22:49:10,571 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 602) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 613) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 624) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 511) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 317) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L439 ceAbstractionStarter]: At program point L210(lines 209 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:49:10,572 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 82) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L443 ceAbstractionStarter]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L446 ceAbstractionStarter]: At program point L673(lines 66 675) the Hoare annotation is: true [2019-11-15 22:49:10,572 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 646) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 546) no Hoare annotation was computed. [2019-11-15 22:49:10,572 INFO L446 ceAbstractionStarter]: At program point L674(lines 9 676) the Hoare annotation is: true [2019-11-15 22:49:10,573 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2019-11-15 22:49:10,573 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 601) no Hoare annotation was computed. [2019-11-15 22:49:10,573 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 612) no Hoare annotation was computed. [2019-11-15 22:49:10,573 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 623) no Hoare annotation was computed. [2019-11-15 22:49:10,573 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-15 22:49:10,573 INFO L443 ceAbstractionStarter]: For program point L312-2(lines 211 588) no Hoare annotation was computed. [2019-11-15 22:49:10,573 INFO L439 ceAbstractionStarter]: At program point L180(lines 176 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))) (and (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse3))) [2019-11-15 22:49:10,573 INFO L439 ceAbstractionStarter]: At program point L147(lines 143 613) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse2 .cse0 .cse1) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-15 22:49:10,573 INFO L439 ceAbstractionStarter]: At program point L214(lines 107 625) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:49:10,573 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L446-1(lines 446 458) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 600) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 611) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 622) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L439 ceAbstractionStarter]: At program point L414(lines 405 425) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 352) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L348-2(lines 211 588) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 93) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 66 675) no Hoare annotation was computed. [2019-11-15 22:49:10,574 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 454) no Hoare annotation was computed. [2019-11-15 22:49:10,575 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:49:10,575 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 599) no Hoare annotation was computed. [2019-11-15 22:49:10,575 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 610) no Hoare annotation was computed. [2019-11-15 22:49:10,575 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 621) no Hoare annotation was computed. [2019-11-15 22:49:10,575 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 90) no Hoare annotation was computed. [2019-11-15 22:49:10,575 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 421) no Hoare annotation was computed. [2019-11-15 22:49:10,575 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 223) no Hoare annotation was computed. [2019-11-15 22:49:10,575 INFO L439 ceAbstractionStarter]: At program point L186(lines 182 600) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) (let ((.cse0 (and (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (and .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse5 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (let ((.cse6 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse6) (<= .cse6 8496))))) (or (and .cse0 .cse1) (and .cse2 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse5) (and .cse2 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1)))) [2019-11-15 22:49:10,576 INFO L439 ceAbstractionStarter]: At program point L153(lines 149 611) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and .cse2 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 .cse1 (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-15 22:49:10,576 INFO L443 ceAbstractionStarter]: For program point L219-2(lines 211 588) no Hoare annotation was computed. [2019-11-15 22:49:10,577 INFO L443 ceAbstractionStarter]: For program point L551(lines 551 555) no Hoare annotation was computed. [2019-11-15 22:49:10,577 INFO L443 ceAbstractionStarter]: For program point L485(lines 485 489) no Hoare annotation was computed. [2019-11-15 22:49:10,577 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 598) no Hoare annotation was computed. [2019-11-15 22:49:10,577 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 609) no Hoare annotation was computed. [2019-11-15 22:49:10,577 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 620) no Hoare annotation was computed. [2019-11-15 22:49:10,577 INFO L439 ceAbstractionStarter]: At program point L552(lines 66 675) the Hoare annotation is: false [2019-11-15 22:49:10,577 INFO L439 ceAbstractionStarter]: At program point L123(lines 119 621) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse6 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse6 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse6) (<= .cse6 2147483647))))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (let ((.cse5 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse5) (<= .cse5 8496))))) (or (and .cse0 .cse1 .cse2 (and .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse3 .cse2))) [2019-11-15 22:49:10,577 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:49:10,577 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2019-11-15 22:49:10,577 INFO L446 ceAbstractionStarter]: At program point L686(lines 677 688) the Hoare annotation is: true [2019-11-15 22:49:10,577 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 387) no Hoare annotation was computed. [2019-11-15 22:49:10,578 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-15 22:49:10,578 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 262) no Hoare annotation was computed. [2019-11-15 22:49:10,578 INFO L443 ceAbstractionStarter]: For program point L323-2(lines 323 327) no Hoare annotation was computed. [2019-11-15 22:49:10,578 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 597) no Hoare annotation was computed. [2019-11-15 22:49:10,578 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 608) no Hoare annotation was computed. [2019-11-15 22:49:10,578 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 619) no Hoare annotation was computed. [2019-11-15 22:49:10,578 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-15 22:49:10,578 INFO L439 ceAbstractionStarter]: At program point L192(lines 188 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))) (and .cse0 .cse2 .cse1 .cse3 .cse5) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse3 .cse5))) [2019-11-15 22:49:10,578 INFO L439 ceAbstractionStarter]: At program point L159(lines 155 609) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-15 22:49:10,578 INFO L439 ceAbstractionStarter]: At program point L126(lines 125 619) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse2 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse4 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse4 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse4) (<= .cse4 2147483647))))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse0 (not .cse1)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 .cse0 .cse1) (and .cse2 .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2019-11-15 22:49:10,579 INFO L439 ceAbstractionStarter]: At program point L589(lines 101 657) the Hoare annotation is: (let ((.cse22 (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2))) (.cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (.cse9 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse19 (and .cse18 .cse10 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse16 (and .cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1)) (.cse20 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse11 (not .cse8)) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse17 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (let ((.cse24 (mod .cse22 4294967296))) (or (< 2147483647 .cse24) (<= .cse24 8496)))) (.cse23 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse0 .cse4) (and .cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse4) (and .cse9 .cse10 .cse7 .cse11) (and .cse9 .cse10 .cse12 .cse11) (and .cse6 .cse7 .cse1) (and .cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse13 .cse14) (and (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse15 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse15 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse15) (<= .cse15 2147483647)))) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse16 .cse17) (and .cse2 .cse5 .cse13 .cse4) (and .cse1 .cse4) (and .cse18 .cse1 .cse12) (and .cse2 .cse5 .cse18 .cse12 .cse4) (and .cse19 .cse11) (and (and .cse5 .cse19) .cse4) (and .cse1 .cse5 .cse7 .cse14) (and .cse20 .cse16) (and .cse2 .cse20 .cse5 .cse4) (and .cse1 .cse21 .cse7) (and (= (+ ULTIMATE.start_ssl3_accept_~s__state~0 (* 4294967296 (div .cse22 4294967296))) (+ (* 2 ULTIMATE.start_ssl3_accept_~ag_Y~0) (* 2 ULTIMATE.start_ssl3_accept_~ag_X~0))) .cse1) (and .cse2 .cse11) (and .cse3 .cse1) (and (and .cse2 .cse23) .cse4) (and .cse10 .cse8 .cse21 .cse7 .cse4) (and .cse2 .cse17 .cse5 .cse4) (and .cse23 .cse1)))) [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 560) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 211 588) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 386) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L359-1(lines 359 386) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 596) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 607) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 618) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 383) no Hoare annotation was computed. [2019-11-15 22:49:10,579 INFO L446 ceAbstractionStarter]: At program point L658(lines 100 659) the Hoare annotation is: true [2019-11-15 22:49:10,579 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 426) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 595) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 606) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 617) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 655) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 382) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 248) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L439 ceAbstractionStarter]: At program point L198(lines 194 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 (let ((.cse4 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse4) (<= .cse4 8496)))) (and .cse3 .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2))) [2019-11-15 22:49:10,580 INFO L439 ceAbstractionStarter]: At program point L165(lines 161 607) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse2) (and (and .cse0 .cse1 .cse2) (let ((.cse3 (mod (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2)) 4294967296))) (or (< 2147483647 .cse3) (<= .cse3 8496)))))) [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L231-2(lines 211 588) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 652) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L562(lines 562 566) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-15 22:49:10,580 INFO L443 ceAbstractionStarter]: For program point L496(lines 496 500) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L562-2(lines 562 566) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L529-2(lines 211 588) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L364(lines 364 368) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L364-2(lines 363 380) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 666) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 638) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L662-2(lines 662 666) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L629-2(lines 628 650) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L332-1(lines 332 341) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 238) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 594) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 605) no Hoare annotation was computed. [2019-11-15 22:49:10,581 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 616) no Hoare annotation was computed. [2019-11-15 22:49:10,582 INFO L439 ceAbstractionStarter]: At program point L101-2(lines 101 657) the Hoare annotation is: (let ((.cse21 (+ (* ULTIMATE.start_ssl3_accept_~ag_Y~0 2) (* ULTIMATE.start_ssl3_accept_~ag_X~0 2))) (.cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (.cse9 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse18 (and .cse17 .cse10 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse15 (and .cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1)) (.cse19 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse11 (not .cse8)) (.cse3 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse16 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (let ((.cse24 (mod .cse21 4294967296))) (or (< 2147483647 .cse24) (<= .cse24 8496)))) (.cse22 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse0 .cse4) (and .cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse4) (and .cse9 .cse10 .cse7 .cse11) (and .cse9 .cse10 .cse12 .cse11) (and .cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse13 .cse14) (and .cse15 .cse16) (and .cse2 .cse5 .cse13 .cse4) (and .cse1 .cse4) (and .cse17 .cse1 .cse12) (and .cse2 .cse5 .cse17 .cse12 .cse4) (and .cse18 .cse11) (and (and .cse5 .cse18) .cse4) (and .cse1 .cse5 .cse7 .cse14) (and .cse19 .cse15) (and .cse2 .cse19 .cse5 .cse4) (and .cse1 .cse20 .cse7) (and (= (+ ULTIMATE.start_ssl3_accept_~s__state~0 (* 4294967296 (div .cse21 4294967296))) (+ (* 2 ULTIMATE.start_ssl3_accept_~ag_Y~0) (* 2 ULTIMATE.start_ssl3_accept_~ag_X~0))) .cse1) (and .cse2 .cse11) (and .cse3 .cse1) (and (and .cse2 .cse22) .cse4) (and .cse10 .cse8 .cse20 .cse7 .cse4) (and .cse2 .cse16 .cse5 .cse4) (and .cse22 .cse1) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) .cse6 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse23 (mod (+ (* v_prenex_1 2) (* v_prenex_2 2)) 4294967296))) (and (<= .cse23 8496) (<= ULTIMATE.start_ssl3_accept_~s__state~0 .cse23) (<= .cse23 2147483647)))) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))))) [2019-11-15 22:49:10,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:49:10 BoogieIcfgContainer [2019-11-15 22:49:10,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:49:10,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:49:10,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:49:10,686 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:49:10,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:48:06" (3/4) ... [2019-11-15 22:49:10,690 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:49:10,714 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:49:10,715 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:49:10,766 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1)) || (((((!(s__state == 8481) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) && !(s__state == 8480)) [2019-11-15 22:49:10,767 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8496) && blastFlag <= 1) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) [2019-11-15 22:49:10,767 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && 0 == s__hit)) || (((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) [2019-11-15 22:49:10,767 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((!(s__state == 8448) && s__state <= 8448) && blastFlag <= 1)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((8466 <= s__state && blastFlag <= 1) && !(s__state == 8481)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && !(s__state == 8480))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1) [2019-11-15 22:49:10,768 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(s__state == 8481) && !(s__state == 8448)) && (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((!(s__state == 8496) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8480)) [2019-11-15 22:49:10,877 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_170baed8-17b4-4c9a-a0b4-ea6b45bb0d90/bin/uautomizer/witness.graphml [2019-11-15 22:49:10,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:49:10,879 INFO L168 Benchmark]: Toolchain (without parser) took 65667.01 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 946.1 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 608.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:10,879 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:49:10,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:10,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.44 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:49:10,880 INFO L168 Benchmark]: Boogie Preprocessor took 42.46 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:49:10,881 INFO L168 Benchmark]: RCFGBuilder took 860.01 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:10,881 INFO L168 Benchmark]: TraceAbstraction took 64088.80 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 22:49:10,881 INFO L168 Benchmark]: Witness Printer took 191.67 ms. Allocated memory is still 3.0 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:10,884 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.44 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 42.46 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 860.01 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: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64088.80 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 191.67 ms. Allocated memory is still 3.0 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 669]: 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: 182]: Loop Invariant Derived loop invariant: ((((8576 <= s__state && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || ((8576 <= s__state && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant [2019-11-15 22:49:10,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((!(s__state == 8481) && !(s__state == 8448)) && (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((!(s__state == 8496) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8480)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) || ((((blastFlag <= 3 && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3)) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || ((s__state <= 8448 && blastFlag <= 1) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || ((blastFlag <= 2 && s__state <= 8448) && !(0 == s__hit))) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 125]: Loop Invariant [2019-11-15 22:49:10,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && 0 == s__hit)) || (((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && blastFlag <= 2) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((8512 <= s__state && blastFlag <= 2) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8656 <= s__state) && !(0 == s__hit)) || (blastFlag <= 1 && 8656 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 677]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576)) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 119]: Loop Invariant [2019-11-15 22:49:10,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((8466 <= s__state && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8496) && blastFlag <= 1) || (((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8466 <= s__state) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 101]: Loop Invariant [2019-11-15 22:49:10,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((!(s__state == 8448) && s__state <= 8448) && blastFlag <= 1)) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((8466 <= s__state && blastFlag <= 1) && !(s__state == 8481)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && !(s__state == 8480))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__state == 8672)) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) || ((((!(s__state == 8673) && blastFlag <= 3) && !(s__state == 8672)) && 8656 <= s__state) && !(0 == s__hit))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8656 <= s__state) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((((blastFlag <= 2 && 8576 <= s__state) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8576 <= s__state) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && blastFlag <= 2) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((8512 <= s__state && blastFlag <= 2) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((8512 <= s__state && blastFlag <= 2) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (((8512 <= s__state && blastFlag <= 2) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 2 && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) || ((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8640 <= s__state)) || (((((8640 <= s__s3__tmp__next_state___0 && !(s__state == 8673)) && blastFlag <= 3) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((8512 <= s__state && blastFlag <= 1) && s__state <= 8576) || ((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit))) || (((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((!(s__state == 8481) && (((8466 <= s__state && ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state || ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state + 4294967296 && 2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296))) && blastFlag <= 1) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) && !(s__state == 8480)) || ((blastFlag <= 2 && !(s__state == 8673) && !(s__state == 8672)) && !(0 == s__hit))) || ((!(s__state == 8481) && !(s__state == 8480)) && ((8466 <= s__state && ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state || ((ag_Y * 2 + ag_X * 2) % 4294967296 <= s__state + 4294967296 && 2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296))) && (blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - InvariantResult [Line: 101]: Loop Invariant [2019-11-15 22:49:10,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-15 22:49:10,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 22:49:10,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((s__state == 8528 && blastFlag <= 1) || ((blastFlag <= 2 && s__state == 8544) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((s__s3__tmp__next_state___0 <= 8576 && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit)) || ((blastFlag <= 2 && s__state == 8528) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 2 && s__state == 8512) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(0 == s__hit))) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(0 == s__hit))) || ((((s__s3__tmp__next_state___0 <= 8576 && 8576 <= s__state) && blastFlag <= 1) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1) && 8608 == s__state)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (blastFlag <= 1 && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((!(s__state == 8673) && blastFlag <= 1) && 8640 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && 8640 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && (!(s__state == 8673) && blastFlag <= 3) && 8656 <= s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0)) || (s__state == 8592 && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((blastFlag <= 2 && s__state == 8592) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((blastFlag <= 1 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state + 4294967296 * ((ag_Y * 2 + ag_X * 2) / 4294967296) == 2 * ag_Y + 2 * ag_X && blastFlag <= 1)) || (blastFlag <= 2 && !(0 == s__hit))) || (s__state == 8544 && blastFlag <= 1)) || ((blastFlag <= 2 && 8560 == s__state) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || ((((blastFlag <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (((blastFlag <= 2 && 8608 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496))) || (8560 == s__state && blastFlag <= 1)) || (((((!(s__state == 8481) && !(s__state == 8448)) && (\exists v_prenex_2 : int, v_prenex_1 : int :: ((v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 8496 && s__state <= (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296) && (v_prenex_1 * 2 + v_prenex_2 * 2) % 4294967296 <= 2147483647)) && !(s__state == 8496)) && blastFlag <= 1) && !(s__state == 8480)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 8512 <= s__state) && !(s__state == 8673)) && !(s__state == 8672)) && !(0 == s__hit)) || (8576 <= s__state && (!(s__state == 8673) && !(s__state == 8672)) && blastFlag <= 1)) || (((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8673)) && (2147483647 < (ag_Y * 2 + ag_X * 2) % 4294967296 || (ag_Y * 2 + ag_X * 2) % 4294967296 <= 8496)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 63.9s, OverallIterations: 29, TraceHistogramMax: 21, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 33.8s, HoareTripleCheckerStatistics: 5771 SDtfs, 3193 SDslu, 4135 SDs, 0 SdLazy, 4229 SolverSat, 666 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3420 GetRequests, 3362 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16029occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 9456 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 955 NumberOfFragments, 2969 HoareAnnotationTreeSize, 29 FomulaSimplifications, 196409 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 29 FomulaSimplificationsInter, 91448 FormulaSimplificationTreeSizeReductionInter, 29.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 11805 NumberOfCodeBlocks, 11805 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 11768 ConstructedInterpolants, 35 QuantifiedInterpolants, 10985739 SizeOfPredicates, 13 NumberOfNonLiveVariables, 5126 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 37 InterpolantComputations, 24 PerfectInterpolantSequences, 56363/57069 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...