./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-678e011 [2019-11-20 08:38:33,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:38:33,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:38:33,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:38:33,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:38:33,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:38:33,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:38:33,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:38:33,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:38:33,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:38:33,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:38:33,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:38:33,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:38:33,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:38:33,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:38:33,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:38:33,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:38:33,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:38:33,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:38:33,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:38:33,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:38:33,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:38:33,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:38:33,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:38:33,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:38:33,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:38:33,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:38:33,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:38:33,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:38:33,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:38:33,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:38:33,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:38:33,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:38:33,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:38:33,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:38:33,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:38:33,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:38:33,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:38:33,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:38:33,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:38:33,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:38:33,733 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 08:38:33,756 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:38:33,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:38:33,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:38:33,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:38:33,769 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:38:33,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:38:33,769 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:38:33,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:38:33,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:38:33,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:38:33,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:38:33,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:38:33,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:38:33,771 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:38:33,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:38:33,771 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:38:33,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:38:33,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:38:33,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:38:33,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:38:33,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:38:33,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:38:33,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:38:33,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:38:33,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:38:33,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 08:38:33,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 08:38:33,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:38:33,775 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_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:38:33,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:38:33,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:38:33,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:38:33,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:38:33,957 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:38:33,959 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2019-11-20 08:38:34,016 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/data/60de7d844/1639f6c7c5a84d0d824a8a82a9881a18/FLAG190488563 [2019-11-20 08:38:34,463 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:38:34,464 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2019-11-20 08:38:34,477 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/data/60de7d844/1639f6c7c5a84d0d824a8a82a9881a18/FLAG190488563 [2019-11-20 08:38:34,830 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/data/60de7d844/1639f6c7c5a84d0d824a8a82a9881a18 [2019-11-20 08:38:34,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:38:34,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:38:34,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:38:34,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:38:34,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:38:34,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:38:34" (1/1) ... [2019-11-20 08:38:34,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ca1b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:34, skipping insertion in model container [2019-11-20 08:38:34,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:38:34" (1/1) ... [2019-11-20 08:38:34,848 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:38:34,900 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:38:35,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:38:35,204 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:38:35,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:38:35,292 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:38:35,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35 WrapperNode [2019-11-20 08:38:35,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:38:35,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:38:35,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:38:35,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:38:35,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... [2019-11-20 08:38:35,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... [2019-11-20 08:38:35,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:38:35,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:38:35,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:38:35,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:38:35,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... [2019-11-20 08:38:35,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... [2019-11-20 08:38:35,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... [2019-11-20 08:38:35,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... [2019-11-20 08:38:35,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... [2019-11-20 08:38:35,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... [2019-11-20 08:38:35,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... [2019-11-20 08:38:35,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:38:35,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:38:35,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:38:35,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:38:35,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:38:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:38:35,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:38:35,668 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 08:38:36,268 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 08:38:36,268 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 08:38:36,269 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:38:36,270 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 08:38:36,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:38:36 BoogieIcfgContainer [2019-11-20 08:38:36,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:38:36,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:38:36,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:38:36,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:38:36,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:38:34" (1/3) ... [2019-11-20 08:38:36,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d743ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:38:36, skipping insertion in model container [2019-11-20 08:38:36,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:38:35" (2/3) ... [2019-11-20 08:38:36,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d743ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:38:36, skipping insertion in model container [2019-11-20 08:38:36,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:38:36" (3/3) ... [2019-11-20 08:38:36,279 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a_alt.BV.c.cil.c [2019-11-20 08:38:36,288 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:38:36,296 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 08:38:36,306 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 08:38:36,346 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:38:36,346 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 08:38:36,346 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:38:36,346 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:38:36,346 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:38:36,347 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:38:36,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:38:36,347 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:38:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-20 08:38:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 08:38:36,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:36,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:36,383 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:36,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:36,389 INFO L82 PathProgramCache]: Analyzing trace with hash -91609757, now seen corresponding path program 1 times [2019-11-20 08:38:36,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:36,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307236149] [2019-11-20 08:38:36,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:36,677 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-20 08:38:36,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307236149] [2019-11-20 08:38:36,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:36,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:38:36,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675213015] [2019-11-20 08:38:36,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:36,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:36,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:36,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:36,697 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-20 08:38:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:37,023 INFO L93 Difference]: Finished difference Result 316 states and 546 transitions. [2019-11-20 08:38:37,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:37,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-20 08:38:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:37,034 INFO L225 Difference]: With dead ends: 316 [2019-11-20 08:38:37,035 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 08:38:37,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 08:38:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2019-11-20 08:38:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 08:38:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2019-11-20 08:38:37,088 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 43 [2019-11-20 08:38:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:37,089 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2019-11-20 08:38:37,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2019-11-20 08:38:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 08:38:37,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:37,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:37,092 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1448029290, now seen corresponding path program 1 times [2019-11-20 08:38:37,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:37,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175435144] [2019-11-20 08:38:37,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:37,149 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-20 08:38:37,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175435144] [2019-11-20 08:38:37,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:37,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:38:37,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619131526] [2019-11-20 08:38:37,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:37,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:37,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:37,153 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand 3 states. [2019-11-20 08:38:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:37,369 INFO L93 Difference]: Finished difference Result 351 states and 564 transitions. [2019-11-20 08:38:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:37,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 08:38:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:37,373 INFO L225 Difference]: With dead ends: 351 [2019-11-20 08:38:37,373 INFO L226 Difference]: Without dead ends: 201 [2019-11-20 08:38:37,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-20 08:38:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2019-11-20 08:38:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-20 08:38:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 319 transitions. [2019-11-20 08:38:37,392 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 319 transitions. Word has length 44 [2019-11-20 08:38:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:37,393 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 319 transitions. [2019-11-20 08:38:37,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 319 transitions. [2019-11-20 08:38:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 08:38:37,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:37,396 INFO L410 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-20 08:38:37,396 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2008911458, now seen corresponding path program 1 times [2019-11-20 08:38:37,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:37,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254397946] [2019-11-20 08:38:37,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:37,479 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-20 08:38:37,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254397946] [2019-11-20 08:38:37,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:37,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:37,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580975152] [2019-11-20 08:38:37,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:37,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:37,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:37,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:37,484 INFO L87 Difference]: Start difference. First operand 196 states and 319 transitions. Second operand 3 states. [2019-11-20 08:38:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:37,542 INFO L93 Difference]: Finished difference Result 572 states and 934 transitions. [2019-11-20 08:38:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:37,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-20 08:38:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:37,550 INFO L225 Difference]: With dead ends: 572 [2019-11-20 08:38:37,550 INFO L226 Difference]: Without dead ends: 383 [2019-11-20 08:38:37,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-20 08:38:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2019-11-20 08:38:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-20 08:38:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 623 transitions. [2019-11-20 08:38:37,579 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 623 transitions. Word has length 59 [2019-11-20 08:38:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:37,580 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 623 transitions. [2019-11-20 08:38:37,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 623 transitions. [2019-11-20 08:38:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 08:38:37,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:37,586 INFO L410 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-20 08:38:37,586 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash 44999767, now seen corresponding path program 1 times [2019-11-20 08:38:37,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:37,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116251168] [2019-11-20 08:38:37,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:37,646 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-20 08:38:37,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116251168] [2019-11-20 08:38:37,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:37,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:38:37,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886790741] [2019-11-20 08:38:37,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:37,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:37,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:37,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:37,649 INFO L87 Difference]: Start difference. First operand 383 states and 623 transitions. Second operand 3 states. [2019-11-20 08:38:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:37,827 INFO L93 Difference]: Finished difference Result 811 states and 1316 transitions. [2019-11-20 08:38:37,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:37,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-20 08:38:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:37,832 INFO L225 Difference]: With dead ends: 811 [2019-11-20 08:38:37,832 INFO L226 Difference]: Without dead ends: 435 [2019-11-20 08:38:37,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-20 08:38:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-11-20 08:38:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-20 08:38:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 685 transitions. [2019-11-20 08:38:37,875 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 685 transitions. Word has length 80 [2019-11-20 08:38:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:37,877 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 685 transitions. [2019-11-20 08:38:37,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 685 transitions. [2019-11-20 08:38:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 08:38:37,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:37,889 INFO L410 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-20 08:38:37,890 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:37,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:37,890 INFO L82 PathProgramCache]: Analyzing trace with hash 586802411, now seen corresponding path program 1 times [2019-11-20 08:38:37,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:37,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636508389] [2019-11-20 08:38:37,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:38,004 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-20 08:38:38,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636508389] [2019-11-20 08:38:38,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:38,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:38:38,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955583016] [2019-11-20 08:38:38,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:38,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:38,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:38,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:38,010 INFO L87 Difference]: Start difference. First operand 425 states and 685 transitions. Second operand 3 states. [2019-11-20 08:38:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:38,184 INFO L93 Difference]: Finished difference Result 853 states and 1374 transitions. [2019-11-20 08:38:38,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:38,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-20 08:38:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:38,189 INFO L225 Difference]: With dead ends: 853 [2019-11-20 08:38:38,189 INFO L226 Difference]: Without dead ends: 435 [2019-11-20 08:38:38,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-20 08:38:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-11-20 08:38:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-20 08:38:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 681 transitions. [2019-11-20 08:38:38,207 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 681 transitions. Word has length 81 [2019-11-20 08:38:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:38,208 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 681 transitions. [2019-11-20 08:38:38,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 681 transitions. [2019-11-20 08:38:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 08:38:38,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:38,209 INFO L410 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-20 08:38:38,210 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:38,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:38,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1514553016, now seen corresponding path program 1 times [2019-11-20 08:38:38,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:38,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773634883] [2019-11-20 08:38:38,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:38,281 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-20 08:38:38,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773634883] [2019-11-20 08:38:38,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:38,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:38,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964051119] [2019-11-20 08:38:38,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:38,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:38,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:38,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:38,284 INFO L87 Difference]: Start difference. First operand 425 states and 681 transitions. Second operand 3 states. [2019-11-20 08:38:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:38,474 INFO L93 Difference]: Finished difference Result 971 states and 1575 transitions. [2019-11-20 08:38:38,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:38,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 08:38:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:38,478 INFO L225 Difference]: With dead ends: 971 [2019-11-20 08:38:38,479 INFO L226 Difference]: Without dead ends: 553 [2019-11-20 08:38:38,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-20 08:38:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 543. [2019-11-20 08:38:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-11-20 08:38:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 797 transitions. [2019-11-20 08:38:38,498 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 797 transitions. Word has length 96 [2019-11-20 08:38:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:38,499 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 797 transitions. [2019-11-20 08:38:38,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 797 transitions. [2019-11-20 08:38:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 08:38:38,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:38,501 INFO L410 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-20 08:38:38,501 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:38,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:38,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1948282102, now seen corresponding path program 1 times [2019-11-20 08:38:38,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:38,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38959315] [2019-11-20 08:38:38,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:38,570 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-20 08:38:38,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38959315] [2019-11-20 08:38:38,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:38,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:38,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124838608] [2019-11-20 08:38:38,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:38,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:38,573 INFO L87 Difference]: Start difference. First operand 543 states and 797 transitions. Second operand 3 states. [2019-11-20 08:38:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:38,765 INFO L93 Difference]: Finished difference Result 1167 states and 1733 transitions. [2019-11-20 08:38:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:38,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 08:38:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:38,769 INFO L225 Difference]: With dead ends: 1167 [2019-11-20 08:38:38,770 INFO L226 Difference]: Without dead ends: 631 [2019-11-20 08:38:38,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-20 08:38:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 605. [2019-11-20 08:38:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-11-20 08:38:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 885 transitions. [2019-11-20 08:38:38,790 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 885 transitions. Word has length 96 [2019-11-20 08:38:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:38,790 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 885 transitions. [2019-11-20 08:38:38,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 885 transitions. [2019-11-20 08:38:38,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 08:38:38,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:38,793 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:38:38,793 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:38,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:38,793 INFO L82 PathProgramCache]: Analyzing trace with hash 564782516, now seen corresponding path program 1 times [2019-11-20 08:38:38,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:38,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332477266] [2019-11-20 08:38:38,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:38,863 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-20 08:38:38,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332477266] [2019-11-20 08:38:38,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:38,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:38,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110593665] [2019-11-20 08:38:38,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:38,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:38,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:38,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:38,866 INFO L87 Difference]: Start difference. First operand 605 states and 885 transitions. Second operand 3 states. [2019-11-20 08:38:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:38,903 INFO L93 Difference]: Finished difference Result 905 states and 1324 transitions. [2019-11-20 08:38:38,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:38,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-20 08:38:38,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:38,909 INFO L225 Difference]: With dead ends: 905 [2019-11-20 08:38:38,909 INFO L226 Difference]: Without dead ends: 903 [2019-11-20 08:38:38,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-20 08:38:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-11-20 08:38:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-11-20 08:38:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1322 transitions. [2019-11-20 08:38:38,936 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1322 transitions. Word has length 120 [2019-11-20 08:38:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:38,937 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1322 transitions. [2019-11-20 08:38:38,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1322 transitions. [2019-11-20 08:38:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 08:38:38,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:38,943 INFO L410 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-20 08:38:38,943 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:38,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1174075643, now seen corresponding path program 1 times [2019-11-20 08:38:38,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:38,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768344107] [2019-11-20 08:38:38,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:39,021 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-20 08:38:39,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768344107] [2019-11-20 08:38:39,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:39,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:39,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516790811] [2019-11-20 08:38:39,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:39,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:39,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:39,029 INFO L87 Difference]: Start difference. First operand 903 states and 1322 transitions. Second operand 3 states. [2019-11-20 08:38:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:39,171 INFO L93 Difference]: Finished difference Result 1877 states and 2732 transitions. [2019-11-20 08:38:39,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:39,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-20 08:38:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:39,178 INFO L225 Difference]: With dead ends: 1877 [2019-11-20 08:38:39,178 INFO L226 Difference]: Without dead ends: 981 [2019-11-20 08:38:39,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-11-20 08:38:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 972. [2019-11-20 08:38:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-20 08:38:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1406 transitions. [2019-11-20 08:38:39,209 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1406 transitions. Word has length 184 [2019-11-20 08:38:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:39,210 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1406 transitions. [2019-11-20 08:38:39,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1406 transitions. [2019-11-20 08:38:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 08:38:39,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:39,214 INFO L410 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-20 08:38:39,214 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:39,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1179429289, now seen corresponding path program 1 times [2019-11-20 08:38:39,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:39,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952383601] [2019-11-20 08:38:39,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:39,325 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-20 08:38:39,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952383601] [2019-11-20 08:38:39,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:39,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:39,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432382831] [2019-11-20 08:38:39,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:39,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:39,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:39,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:39,330 INFO L87 Difference]: Start difference. First operand 972 states and 1406 transitions. Second operand 3 states. [2019-11-20 08:38:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:39,476 INFO L93 Difference]: Finished difference Result 2048 states and 2960 transitions. [2019-11-20 08:38:39,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:39,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-20 08:38:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:39,483 INFO L225 Difference]: With dead ends: 2048 [2019-11-20 08:38:39,484 INFO L226 Difference]: Without dead ends: 1083 [2019-11-20 08:38:39,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-20 08:38:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1047. [2019-11-20 08:38:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-11-20 08:38:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1496 transitions. [2019-11-20 08:38:39,520 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1496 transitions. Word has length 204 [2019-11-20 08:38:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:39,520 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 1496 transitions. [2019-11-20 08:38:39,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1496 transitions. [2019-11-20 08:38:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-20 08:38:39,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:39,526 INFO L410 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-20 08:38:39,527 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1179962115, now seen corresponding path program 1 times [2019-11-20 08:38:39,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:39,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897428649] [2019-11-20 08:38:39,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:39,603 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-20 08:38:39,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897428649] [2019-11-20 08:38:39,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:39,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:39,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304297636] [2019-11-20 08:38:39,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:39,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:39,605 INFO L87 Difference]: Start difference. First operand 1047 states and 1496 transitions. Second operand 3 states. [2019-11-20 08:38:39,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:39,651 INFO L93 Difference]: Finished difference Result 3109 states and 4430 transitions. [2019-11-20 08:38:39,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:39,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-20 08:38:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:39,662 INFO L225 Difference]: With dead ends: 3109 [2019-11-20 08:38:39,662 INFO L226 Difference]: Without dead ends: 2069 [2019-11-20 08:38:39,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-11-20 08:38:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1050. [2019-11-20 08:38:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-11-20 08:38:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1499 transitions. [2019-11-20 08:38:39,702 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1499 transitions. Word has length 230 [2019-11-20 08:38:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:39,702 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 1499 transitions. [2019-11-20 08:38:39,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1499 transitions. [2019-11-20 08:38:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-20 08:38:39,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:39,706 INFO L410 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-20 08:38:39,707 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:39,707 INFO L82 PathProgramCache]: Analyzing trace with hash -150020643, now seen corresponding path program 1 times [2019-11-20 08:38:39,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:39,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689459136] [2019-11-20 08:38:39,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:39,775 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-20 08:38:39,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689459136] [2019-11-20 08:38:39,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:39,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:39,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901464137] [2019-11-20 08:38:39,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:39,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:39,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:39,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:39,778 INFO L87 Difference]: Start difference. First operand 1050 states and 1499 transitions. Second operand 3 states. [2019-11-20 08:38:39,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:39,942 INFO L93 Difference]: Finished difference Result 2195 states and 3134 transitions. [2019-11-20 08:38:39,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:39,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-20 08:38:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:39,949 INFO L225 Difference]: With dead ends: 2195 [2019-11-20 08:38:39,949 INFO L226 Difference]: Without dead ends: 1152 [2019-11-20 08:38:39,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-11-20 08:38:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1131. [2019-11-20 08:38:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-11-20 08:38:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1595 transitions. [2019-11-20 08:38:39,993 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1595 transitions. Word has length 230 [2019-11-20 08:38:39,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:39,993 INFO L462 AbstractCegarLoop]: Abstraction has 1131 states and 1595 transitions. [2019-11-20 08:38:39,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1595 transitions. [2019-11-20 08:38:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-20 08:38:40,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:40,000 INFO L410 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-20 08:38:40,001 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash -336843366, now seen corresponding path program 1 times [2019-11-20 08:38:40,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:40,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647915517] [2019-11-20 08:38:40,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:40,162 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-20 08:38:40,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647915517] [2019-11-20 08:38:40,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:40,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:40,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685857518] [2019-11-20 08:38:40,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:40,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:40,164 INFO L87 Difference]: Start difference. First operand 1131 states and 1595 transitions. Second operand 3 states. [2019-11-20 08:38:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:40,235 INFO L93 Difference]: Finished difference Result 3373 states and 4754 transitions. [2019-11-20 08:38:40,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:40,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-20 08:38:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:40,248 INFO L225 Difference]: With dead ends: 3373 [2019-11-20 08:38:40,248 INFO L226 Difference]: Without dead ends: 2249 [2019-11-20 08:38:40,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-20 08:38:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2247. [2019-11-20 08:38:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2019-11-20 08:38:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3163 transitions. [2019-11-20 08:38:40,324 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3163 transitions. Word has length 231 [2019-11-20 08:38:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:40,325 INFO L462 AbstractCegarLoop]: Abstraction has 2247 states and 3163 transitions. [2019-11-20 08:38:40,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3163 transitions. [2019-11-20 08:38:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 08:38:40,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:40,331 INFO L410 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-20 08:38:40,331 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1934345498, now seen corresponding path program 1 times [2019-11-20 08:38:40,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:40,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573187290] [2019-11-20 08:38:40,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:40,406 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-20 08:38:40,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573187290] [2019-11-20 08:38:40,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:40,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:40,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705843104] [2019-11-20 08:38:40,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:40,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:40,408 INFO L87 Difference]: Start difference. First operand 2247 states and 3163 transitions. Second operand 3 states. [2019-11-20 08:38:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:40,615 INFO L93 Difference]: Finished difference Result 4733 states and 6735 transitions. [2019-11-20 08:38:40,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:40,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-20 08:38:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:40,628 INFO L225 Difference]: With dead ends: 4733 [2019-11-20 08:38:40,628 INFO L226 Difference]: Without dead ends: 2433 [2019-11-20 08:38:40,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2019-11-20 08:38:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2019-11-20 08:38:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-11-20 08:38:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3379 transitions. [2019-11-20 08:38:40,702 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3379 transitions. Word has length 232 [2019-11-20 08:38:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:40,703 INFO L462 AbstractCegarLoop]: Abstraction has 2433 states and 3379 transitions. [2019-11-20 08:38:40,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3379 transitions. [2019-11-20 08:38:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-20 08:38:40,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:40,709 INFO L410 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-20 08:38:40,709 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash -462203708, now seen corresponding path program 1 times [2019-11-20 08:38:40,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:40,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570975629] [2019-11-20 08:38:40,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:40,822 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-20 08:38:40,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570975629] [2019-11-20 08:38:40,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646580496] [2019-11-20 08:38:40,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:38:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:40,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:38:40,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:41,026 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-20 08:38:41,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:38:41,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 08:38:41,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146129544] [2019-11-20 08:38:41,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:41,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:41,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:41,029 INFO L87 Difference]: Start difference. First operand 2433 states and 3379 transitions. Second operand 3 states. [2019-11-20 08:38:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:41,136 INFO L93 Difference]: Finished difference Result 5667 states and 7870 transitions. [2019-11-20 08:38:41,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:41,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-20 08:38:41,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:41,154 INFO L225 Difference]: With dead ends: 5667 [2019-11-20 08:38:41,154 INFO L226 Difference]: Without dead ends: 3241 [2019-11-20 08:38:41,157 INFO L630 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-20 08:38:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2019-11-20 08:38:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3241. [2019-11-20 08:38:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2019-11-20 08:38:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4500 transitions. [2019-11-20 08:38:41,253 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4500 transitions. Word has length 244 [2019-11-20 08:38:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:41,254 INFO L462 AbstractCegarLoop]: Abstraction has 3241 states and 4500 transitions. [2019-11-20 08:38:41,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4500 transitions. [2019-11-20 08:38:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 08:38:41,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:41,261 INFO L410 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-20 08:38:41,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:41,466 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash 464017511, now seen corresponding path program 1 times [2019-11-20 08:38:41,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:41,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823964533] [2019-11-20 08:38:41,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:41,583 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-20 08:38:41,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823964533] [2019-11-20 08:38:41,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535457006] [2019-11-20 08:38:41,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:38:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:41,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:41,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:41,824 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-20 08:38:41,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:38:41,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 08:38:41,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47238209] [2019-11-20 08:38:41,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:38:41,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:38:41,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:38:41,827 INFO L87 Difference]: Start difference. First operand 3241 states and 4500 transitions. Second operand 4 states. [2019-11-20 08:38:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:42,243 INFO L93 Difference]: Finished difference Result 8229 states and 11374 transitions. [2019-11-20 08:38:42,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:38:42,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-20 08:38:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:42,267 INFO L225 Difference]: With dead ends: 8229 [2019-11-20 08:38:42,268 INFO L226 Difference]: Without dead ends: 4995 [2019-11-20 08:38:42,272 INFO L630 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-20 08:38:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2019-11-20 08:38:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4161. [2019-11-20 08:38:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4161 states. [2019-11-20 08:38:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 5572 transitions. [2019-11-20 08:38:42,400 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 5572 transitions. Word has length 252 [2019-11-20 08:38:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:42,400 INFO L462 AbstractCegarLoop]: Abstraction has 4161 states and 5572 transitions. [2019-11-20 08:38:42,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:38:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 5572 transitions. [2019-11-20 08:38:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-20 08:38:42,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:42,412 INFO L410 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-20 08:38:42,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:42,616 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:42,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash 752836901, now seen corresponding path program 1 times [2019-11-20 08:38:42,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:42,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486565540] [2019-11-20 08:38:42,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:42,716 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-20 08:38:42,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486565540] [2019-11-20 08:38:42,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:42,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:42,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059378967] [2019-11-20 08:38:42,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:42,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:42,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:42,718 INFO L87 Difference]: Start difference. First operand 4161 states and 5572 transitions. Second operand 3 states. [2019-11-20 08:38:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:42,848 INFO L93 Difference]: Finished difference Result 11621 states and 15694 transitions. [2019-11-20 08:38:42,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:42,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-20 08:38:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:42,889 INFO L225 Difference]: With dead ends: 11621 [2019-11-20 08:38:42,889 INFO L226 Difference]: Without dead ends: 5141 [2019-11-20 08:38:42,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2019-11-20 08:38:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 4886. [2019-11-20 08:38:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2019-11-20 08:38:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 6668 transitions. [2019-11-20 08:38:43,045 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 6668 transitions. Word has length 252 [2019-11-20 08:38:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:43,045 INFO L462 AbstractCegarLoop]: Abstraction has 4886 states and 6668 transitions. [2019-11-20 08:38:43,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 6668 transitions. [2019-11-20 08:38:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-20 08:38:43,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:43,055 INFO L410 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-20 08:38:43,055 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1551518133, now seen corresponding path program 1 times [2019-11-20 08:38:43,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:43,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550342173] [2019-11-20 08:38:43,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:43,223 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-20 08:38:43,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550342173] [2019-11-20 08:38:43,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:43,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:43,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407161666] [2019-11-20 08:38:43,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:43,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:43,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:43,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:43,228 INFO L87 Difference]: Start difference. First operand 4886 states and 6668 transitions. Second operand 3 states. [2019-11-20 08:38:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:43,427 INFO L93 Difference]: Finished difference Result 10137 states and 13841 transitions. [2019-11-20 08:38:43,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:43,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-11-20 08:38:43,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:43,437 INFO L225 Difference]: With dead ends: 10137 [2019-11-20 08:38:43,438 INFO L226 Difference]: Without dead ends: 5258 [2019-11-20 08:38:43,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-11-20 08:38:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5234. [2019-11-20 08:38:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2019-11-20 08:38:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7076 transitions. [2019-11-20 08:38:43,562 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7076 transitions. Word has length 321 [2019-11-20 08:38:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:43,562 INFO L462 AbstractCegarLoop]: Abstraction has 5234 states and 7076 transitions. [2019-11-20 08:38:43,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7076 transitions. [2019-11-20 08:38:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-11-20 08:38:43,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:43,573 INFO L410 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-20 08:38:43,573 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:43,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:43,574 INFO L82 PathProgramCache]: Analyzing trace with hash -16053374, now seen corresponding path program 1 times [2019-11-20 08:38:43,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:43,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404680015] [2019-11-20 08:38:43,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:43,717 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-20 08:38:43,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404680015] [2019-11-20 08:38:43,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218585303] [2019-11-20 08:38:43,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:38:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:43,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:43,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:44,076 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-20 08:38:44,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:38:44,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 08:38:44,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378977995] [2019-11-20 08:38:44,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:44,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:44,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:44,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:44,079 INFO L87 Difference]: Start difference. First operand 5234 states and 7076 transitions. Second operand 3 states. [2019-11-20 08:38:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:44,145 INFO L93 Difference]: Finished difference Result 6046 states and 8192 transitions. [2019-11-20 08:38:44,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:44,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 354 [2019-11-20 08:38:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:44,154 INFO L225 Difference]: With dead ends: 6046 [2019-11-20 08:38:44,154 INFO L226 Difference]: Without dead ends: 4563 [2019-11-20 08:38:44,157 INFO L630 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-20 08:38:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2019-11-20 08:38:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 3753. [2019-11-20 08:38:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2019-11-20 08:38:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 5068 transitions. [2019-11-20 08:38:44,249 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 5068 transitions. Word has length 354 [2019-11-20 08:38:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:44,250 INFO L462 AbstractCegarLoop]: Abstraction has 3753 states and 5068 transitions. [2019-11-20 08:38:44,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 5068 transitions. [2019-11-20 08:38:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-11-20 08:38:44,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:44,263 INFO L410 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-20 08:38:44,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:44,467 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:44,468 INFO L82 PathProgramCache]: Analyzing trace with hash -235980636, now seen corresponding path program 1 times [2019-11-20 08:38:44,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:44,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505116403] [2019-11-20 08:38:44,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:44,634 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-20 08:38:44,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505116403] [2019-11-20 08:38:44,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107801522] [2019-11-20 08:38:44,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:38:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:44,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:44,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:44,940 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-20 08:38:44,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:38:44,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 08:38:44,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338102765] [2019-11-20 08:38:44,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:38:44,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:44,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:38:44,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:38:44,944 INFO L87 Difference]: Start difference. First operand 3753 states and 5068 transitions. Second operand 4 states. [2019-11-20 08:38:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:45,360 INFO L93 Difference]: Finished difference Result 8431 states and 11397 transitions. [2019-11-20 08:38:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:38:45,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 416 [2019-11-20 08:38:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:45,369 INFO L225 Difference]: With dead ends: 8431 [2019-11-20 08:38:45,369 INFO L226 Difference]: Without dead ends: 4516 [2019-11-20 08:38:45,374 INFO L630 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-20 08:38:45,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2019-11-20 08:38:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 3782. [2019-11-20 08:38:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-11-20 08:38:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5040 transitions. [2019-11-20 08:38:45,482 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5040 transitions. Word has length 416 [2019-11-20 08:38:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:45,483 INFO L462 AbstractCegarLoop]: Abstraction has 3782 states and 5040 transitions. [2019-11-20 08:38:45,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:38:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5040 transitions. [2019-11-20 08:38:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-11-20 08:38:45,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:45,498 INFO L410 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-20 08:38:45,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:45,703 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1952122078, now seen corresponding path program 1 times [2019-11-20 08:38:45,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:45,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755773259] [2019-11-20 08:38:45,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:45,877 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-20 08:38:45,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755773259] [2019-11-20 08:38:45,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125865227] [2019-11-20 08:38:45,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:38:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:46,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:38:46,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:46,163 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-20 08:38:46,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:38:46,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 08:38:46,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501513955] [2019-11-20 08:38:46,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:38:46,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:46,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:38:46,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:38:46,167 INFO L87 Difference]: Start difference. First operand 3782 states and 5040 transitions. Second operand 4 states. [2019-11-20 08:38:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:46,670 INFO L93 Difference]: Finished difference Result 11074 states and 14738 transitions. [2019-11-20 08:38:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:38:46,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 448 [2019-11-20 08:38:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:46,683 INFO L225 Difference]: With dead ends: 11074 [2019-11-20 08:38:46,683 INFO L226 Difference]: Without dead ends: 7488 [2019-11-20 08:38:46,693 INFO L630 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-20 08:38:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7488 states. [2019-11-20 08:38:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7488 to 5198. [2019-11-20 08:38:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5198 states. [2019-11-20 08:38:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 6920 transitions. [2019-11-20 08:38:46,833 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 6920 transitions. Word has length 448 [2019-11-20 08:38:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:46,834 INFO L462 AbstractCegarLoop]: Abstraction has 5198 states and 6920 transitions. [2019-11-20 08:38:46,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:38:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 6920 transitions. [2019-11-20 08:38:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-20 08:38:46,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:46,850 INFO L410 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-20 08:38:47,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:47,055 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:47,055 INFO L82 PathProgramCache]: Analyzing trace with hash -671064672, now seen corresponding path program 1 times [2019-11-20 08:38:47,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:47,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103040199] [2019-11-20 08:38:47,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:47,241 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-20 08:38:47,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103040199] [2019-11-20 08:38:47,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:47,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:38:47,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581981887] [2019-11-20 08:38:47,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:47,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:47,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:47,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:47,245 INFO L87 Difference]: Start difference. First operand 5198 states and 6920 transitions. Second operand 3 states. [2019-11-20 08:38:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:47,460 INFO L93 Difference]: Finished difference Result 11001 states and 14577 transitions. [2019-11-20 08:38:47,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:47,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-20 08:38:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:47,470 INFO L225 Difference]: With dead ends: 11001 [2019-11-20 08:38:47,471 INFO L226 Difference]: Without dead ends: 5810 [2019-11-20 08:38:47,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2019-11-20 08:38:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 5776. [2019-11-20 08:38:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5776 states. [2019-11-20 08:38:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 7583 transitions. [2019-11-20 08:38:47,597 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 7583 transitions. Word has length 493 [2019-11-20 08:38:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:47,597 INFO L462 AbstractCegarLoop]: Abstraction has 5776 states and 7583 transitions. [2019-11-20 08:38:47,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 7583 transitions. [2019-11-20 08:38:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-11-20 08:38:47,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:47,609 INFO L410 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-20 08:38:47,609 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1196437202, now seen corresponding path program 1 times [2019-11-20 08:38:47,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:47,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039950592] [2019-11-20 08:38:47,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:47,870 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-20 08:38:47,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039950592] [2019-11-20 08:38:47,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59910611] [2019-11-20 08:38:47,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:38:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:48,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 08:38:48,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:48,169 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-20 08:38:48,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:38:48,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-20 08:38:48,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068420334] [2019-11-20 08:38:48,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:48,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:48,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:38:48,171 INFO L87 Difference]: Start difference. First operand 5776 states and 7583 transitions. Second operand 3 states. [2019-11-20 08:38:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:48,416 INFO L93 Difference]: Finished difference Result 11733 states and 15463 transitions. [2019-11-20 08:38:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:48,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-11-20 08:38:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:48,426 INFO L225 Difference]: With dead ends: 11733 [2019-11-20 08:38:48,426 INFO L226 Difference]: Without dead ends: 5964 [2019-11-20 08:38:48,433 INFO L630 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-20 08:38:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-11-20 08:38:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5864. [2019-11-20 08:38:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5864 states. [2019-11-20 08:38:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 7707 transitions. [2019-11-20 08:38:48,550 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 7707 transitions. Word has length 508 [2019-11-20 08:38:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:48,550 INFO L462 AbstractCegarLoop]: Abstraction has 5864 states and 7707 transitions. [2019-11-20 08:38:48,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:38:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 7707 transitions. [2019-11-20 08:38:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-11-20 08:38:48,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:48,562 INFO L410 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-20 08:38:48,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:48,767 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:48,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1496383928, now seen corresponding path program 1 times [2019-11-20 08:38:48,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:48,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546305936] [2019-11-20 08:38:48,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:49,705 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-20 08:38:49,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546305936] [2019-11-20 08:38:49,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087232170] [2019-11-20 08:38:49,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:38:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:49,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:38:49,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:38:49,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:49,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:49,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:49,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:38:50,793 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-20 08:38:52,115 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 50 DAG size of output: 16 [2019-11-20 08:38:52,647 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-20 08:38:52,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:38:52,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-11-20 08:38:52,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716055702] [2019-11-20 08:38:52,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 08:38:52,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:52,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 08:38:52,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2019-11-20 08:38:52,649 INFO L87 Difference]: Start difference. First operand 5864 states and 7707 transitions. Second operand 9 states. [2019-11-20 08:38:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:58,412 INFO L93 Difference]: Finished difference Result 23651 states and 30855 transitions. [2019-11-20 08:38:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 08:38:58,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 512 [2019-11-20 08:38:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:58,440 INFO L225 Difference]: With dead ends: 23651 [2019-11-20 08:38:58,441 INFO L226 Difference]: Without dead ends: 17094 [2019-11-20 08:38:58,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 515 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=68, Invalid=145, Unknown=1, NotChecked=26, Total=240 [2019-11-20 08:38:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17094 states. [2019-11-20 08:38:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17094 to 16029. [2019-11-20 08:38:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16029 states. [2019-11-20 08:38:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16029 states to 16029 states and 20135 transitions. [2019-11-20 08:38:58,860 INFO L78 Accepts]: Start accepts. Automaton has 16029 states and 20135 transitions. Word has length 512 [2019-11-20 08:38:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:38:58,861 INFO L462 AbstractCegarLoop]: Abstraction has 16029 states and 20135 transitions. [2019-11-20 08:38:58,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 08:38:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 16029 states and 20135 transitions. [2019-11-20 08:38:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-11-20 08:38:58,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:38:58,893 INFO L410 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-20 08:38:59,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:38:59,106 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:38:59,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:38:59,106 INFO L82 PathProgramCache]: Analyzing trace with hash 76731436, now seen corresponding path program 1 times [2019-11-20 08:38:59,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:38:59,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767375846] [2019-11-20 08:38:59,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:38:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:38:59,359 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-20 08:38:59,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767375846] [2019-11-20 08:38:59,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:38:59,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:38:59,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245887838] [2019-11-20 08:38:59,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:38:59,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:38:59,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:38:59,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:59,362 INFO L87 Difference]: Start difference. First operand 16029 states and 20135 transitions. Second operand 3 states. [2019-11-20 08:38:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:38:59,867 INFO L93 Difference]: Finished difference Result 33490 states and 41898 transitions. [2019-11-20 08:38:59,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:38:59,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 524 [2019-11-20 08:38:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:38:59,895 INFO L225 Difference]: With dead ends: 33490 [2019-11-20 08:38:59,895 INFO L226 Difference]: Without dead ends: 15881 [2019-11-20 08:38:59,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:38:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15881 states. [2019-11-20 08:39:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15881 to 15136. [2019-11-20 08:39:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-20 08:39:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18911 transitions. [2019-11-20 08:39:00,249 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18911 transitions. Word has length 524 [2019-11-20 08:39:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:39:00,249 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18911 transitions. [2019-11-20 08:39:00,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:39:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18911 transitions. [2019-11-20 08:39:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-11-20 08:39:00,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:39:00,267 INFO L410 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-20 08:39:00,267 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:39:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:39:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1215376266, now seen corresponding path program 1 times [2019-11-20 08:39:00,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:39:00,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641571123] [2019-11-20 08:39:00,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:39:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:39:00,466 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-20 08:39:00,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641571123] [2019-11-20 08:39:00,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:39:00,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:39:00,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531466741] [2019-11-20 08:39:00,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:39:00,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:39:00,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:39:00,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:39:00,468 INFO L87 Difference]: Start difference. First operand 15136 states and 18911 transitions. Second operand 3 states. [2019-11-20 08:39:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:39:00,835 INFO L93 Difference]: Finished difference Result 29994 states and 37432 transitions. [2019-11-20 08:39:00,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:39:00,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2019-11-20 08:39:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:39:00,860 INFO L225 Difference]: With dead ends: 29994 [2019-11-20 08:39:00,860 INFO L226 Difference]: Without dead ends: 15184 [2019-11-20 08:39:00,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:39:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2019-11-20 08:39:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15136. [2019-11-20 08:39:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-20 08:39:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18868 transitions. [2019-11-20 08:39:01,217 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18868 transitions. Word has length 536 [2019-11-20 08:39:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:39:01,218 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18868 transitions. [2019-11-20 08:39:01,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:39:01,218 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18868 transitions. [2019-11-20 08:39:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-20 08:39:01,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:39:01,234 INFO L410 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-20 08:39:01,235 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:39:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:39:01,235 INFO L82 PathProgramCache]: Analyzing trace with hash -943603990, now seen corresponding path program 1 times [2019-11-20 08:39:01,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:39:01,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120758404] [2019-11-20 08:39:01,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:39:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:39:01,576 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-20 08:39:01,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120758404] [2019-11-20 08:39:01,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:39:01,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 08:39:01,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662497407] [2019-11-20 08:39:01,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:39:01,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:39:01,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:39:01,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:39:01,578 INFO L87 Difference]: Start difference. First operand 15136 states and 18868 transitions. Second operand 3 states. [2019-11-20 08:39:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:39:01,946 INFO L93 Difference]: Finished difference Result 29994 states and 37349 transitions. [2019-11-20 08:39:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:39:01,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-11-20 08:39:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:39:01,971 INFO L225 Difference]: With dead ends: 29994 [2019-11-20 08:39:01,971 INFO L226 Difference]: Without dead ends: 15184 [2019-11-20 08:39:01,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:39:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2019-11-20 08:39:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15136. [2019-11-20 08:39:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15136 states. [2019-11-20 08:39:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15136 states to 15136 states and 18825 transitions. [2019-11-20 08:39:02,326 INFO L78 Accepts]: Start accepts. Automaton has 15136 states and 18825 transitions. Word has length 537 [2019-11-20 08:39:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:39:02,326 INFO L462 AbstractCegarLoop]: Abstraction has 15136 states and 18825 transitions. [2019-11-20 08:39:02,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:39:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 15136 states and 18825 transitions. [2019-11-20 08:39:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-11-20 08:39:02,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:39:02,344 INFO L410 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-20 08:39:02,345 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:39:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:39:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash 780560607, now seen corresponding path program 1 times [2019-11-20 08:39:02,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:39:02,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198542538] [2019-11-20 08:39:02,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:39:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:39:02,581 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-20 08:39:02,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198542538] [2019-11-20 08:39:02,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:39:02,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:39:02,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608084749] [2019-11-20 08:39:02,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:39:02,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:39:02,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:39:02,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:39:02,583 INFO L87 Difference]: Start difference. First operand 15136 states and 18825 transitions. Second operand 3 states. [2019-11-20 08:39:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:39:02,965 INFO L93 Difference]: Finished difference Result 30231 states and 37579 transitions. [2019-11-20 08:39:02,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:39:02,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 580 [2019-11-20 08:39:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:39:02,985 INFO L225 Difference]: With dead ends: 30231 [2019-11-20 08:39:02,985 INFO L226 Difference]: Without dead ends: 15114 [2019-11-20 08:39:02,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:39:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15114 states. [2019-11-20 08:39:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15114 to 13798. [2019-11-20 08:39:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13798 states. [2019-11-20 08:39:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13798 states to 13798 states and 17082 transitions. [2019-11-20 08:39:03,500 INFO L78 Accepts]: Start accepts. Automaton has 13798 states and 17082 transitions. Word has length 580 [2019-11-20 08:39:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:39:03,501 INFO L462 AbstractCegarLoop]: Abstraction has 13798 states and 17082 transitions. [2019-11-20 08:39:03,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:39:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 13798 states and 17082 transitions. [2019-11-20 08:39:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-11-20 08:39:03,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:39:03,517 INFO L410 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-20 08:39:03,517 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:39:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:39:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1763345373, now seen corresponding path program 2 times [2019-11-20 08:39:03,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:39:03,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872390199] [2019-11-20 08:39:03,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:39:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:39:03,753 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-20 08:39:03,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872390199] [2019-11-20 08:39:03,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371296789] [2019-11-20 08:39:03,753 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/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-20 08:39:03,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 08:39:03,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 08:39:03,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 08:39:03,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:39:04,104 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-20 08:39:04,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:39:04,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 08:39:04,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159218404] [2019-11-20 08:39:04,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:39:04,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:39:04,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:39:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:39:04,107 INFO L87 Difference]: Start difference. First operand 13798 states and 17082 transitions. Second operand 4 states. [2019-11-20 08:39:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:39:04,412 INFO L93 Difference]: Finished difference Result 19952 states and 24719 transitions. [2019-11-20 08:39:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:39:04,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 582 [2019-11-20 08:39:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:39:04,413 INFO L225 Difference]: With dead ends: 19952 [2019-11-20 08:39:04,413 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 08:39:04,422 INFO L630 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-20 08:39:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 08:39:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 08:39:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 08:39:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 08:39:04,423 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 582 [2019-11-20 08:39:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:39:04,424 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 08:39:04,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:39:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 08:39:04,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 08:39:04,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:39:04,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 08:39:04,935 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 118 [2019-11-20 08:39:05,056 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 117 [2019-11-20 08:39:07,487 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 737 DAG size of output: 430 [2019-11-20 08:39:08,952 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 738 DAG size of output: 431 [2019-11-20 08:39:09,422 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 43 [2019-11-20 08:39:20,118 WARN L191 SmtUtils]: Spent 10.69 s on a formula simplification. DAG size of input: 137 DAG size of output: 62 [2019-11-20 08:39:24,156 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 114 DAG size of output: 42 [2019-11-20 08:39:24,405 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 44 [2019-11-20 08:39:24,689 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-20 08:39:25,012 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 33 [2019-11-20 08:39:25,231 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2019-11-20 08:39:25,667 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 38 [2019-11-20 08:39:29,030 WARN L191 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 120 DAG size of output: 54 [2019-11-20 08:39:35,255 WARN L191 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 362 DAG size of output: 119 [2019-11-20 08:39:35,552 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 38 [2019-11-20 08:39:35,747 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 37 [2019-11-20 08:39:36,069 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 39 [2019-11-20 08:39:36,356 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-20 08:39:36,627 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-20 08:39:36,893 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 41 [2019-11-20 08:39:37,165 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2019-11-20 08:39:37,462 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 53 [2019-11-20 08:39:45,474 WARN L191 SmtUtils]: Spent 8.01 s on a formula simplification. DAG size of input: 363 DAG size of output: 116 [2019-11-20 08:39:45,791 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 39 [2019-11-20 08:39:45,794 INFO L440 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-20 08:39:45,795 INFO L440 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-20 08:39:45,795 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-20 08:39:45,795 INFO L444 ceAbstractionStarter]: For program point L631(lines 631 635) no Hoare annotation was computed. [2019-11-20 08:39:45,795 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 593) no Hoare annotation was computed. [2019-11-20 08:39:45,795 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 604) no Hoare annotation was computed. [2019-11-20 08:39:45,795 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 615) no Hoare annotation was computed. [2019-11-20 08:39:45,795 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 626) no Hoare annotation was computed. [2019-11-20 08:39:45,795 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-11-20 08:39:45,796 INFO L440 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-20 08:39:45,796 INFO L440 ceAbstractionStarter]: At program point L105(lines 104 626) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 08:39:45,796 INFO L444 ceAbstractionStarter]: For program point L469(lines 469 480) no Hoare annotation was computed. [2019-11-20 08:39:45,796 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 440) no Hoare annotation was computed. [2019-11-20 08:39:45,796 INFO L440 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-20 08:39:45,796 INFO L440 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-20 08:39:45,796 INFO L444 ceAbstractionStarter]: For program point L239(lines 239 244) no Hoare annotation was computed. [2019-11-20 08:39:45,797 INFO L444 ceAbstractionStarter]: For program point L206(lines 206 592) no Hoare annotation was computed. [2019-11-20 08:39:45,797 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 603) no Hoare annotation was computed. [2019-11-20 08:39:45,797 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 614) no Hoare annotation was computed. [2019-11-20 08:39:45,797 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 625) no Hoare annotation was computed. [2019-11-20 08:39:45,797 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 376) no Hoare annotation was computed. [2019-11-20 08:39:45,797 INFO L440 ceAbstractionStarter]: At program point L207(lines 206 592) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 08:39:45,797 INFO L440 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-20 08:39:45,801 INFO L440 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-20 08:39:45,802 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 83) no Hoare annotation was computed. [2019-11-20 08:39:45,802 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 412) no Hoare annotation was computed. [2019-11-20 08:39:45,802 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 582) no Hoare annotation was computed. [2019-11-20 08:39:45,802 INFO L444 ceAbstractionStarter]: For program point L572-1(lines 572 582) no Hoare annotation was computed. [2019-11-20 08:39:45,803 INFO L444 ceAbstractionStarter]: For program point L473(lines 473 477) no Hoare annotation was computed. [2019-11-20 08:39:45,803 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-11-20 08:39:45,803 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 602) no Hoare annotation was computed. [2019-11-20 08:39:45,803 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 613) no Hoare annotation was computed. [2019-11-20 08:39:45,803 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 624) no Hoare annotation was computed. [2019-11-20 08:39:45,803 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 511) no Hoare annotation was computed. [2019-11-20 08:39:45,804 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 317) no Hoare annotation was computed. [2019-11-20 08:39:45,804 INFO L440 ceAbstractionStarter]: At program point L210(lines 209 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 08:39:45,804 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 82) no Hoare annotation was computed. [2019-11-20 08:39:45,804 INFO L444 ceAbstractionStarter]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2019-11-20 08:39:45,804 INFO L447 ceAbstractionStarter]: At program point L673(lines 66 675) the Hoare annotation is: true [2019-11-20 08:39:45,805 INFO L444 ceAbstractionStarter]: For program point L640(lines 640 646) no Hoare annotation was computed. [2019-11-20 08:39:45,805 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 546) no Hoare annotation was computed. [2019-11-20 08:39:45,805 INFO L447 ceAbstractionStarter]: At program point L674(lines 9 676) the Hoare annotation is: true [2019-11-20 08:39:45,805 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2019-11-20 08:39:45,805 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 601) no Hoare annotation was computed. [2019-11-20 08:39:45,805 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 612) no Hoare annotation was computed. [2019-11-20 08:39:45,806 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 623) no Hoare annotation was computed. [2019-11-20 08:39:45,806 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-20 08:39:45,806 INFO L444 ceAbstractionStarter]: For program point L312-2(lines 211 588) no Hoare annotation was computed. [2019-11-20 08:39:45,806 INFO L440 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-20 08:39:45,806 INFO L440 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-20 08:39:45,807 INFO L440 ceAbstractionStarter]: At program point L214(lines 107 625) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 08:39:45,807 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-11-20 08:39:45,807 INFO L444 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-11-20 08:39:45,807 INFO L444 ceAbstractionStarter]: For program point L446-1(lines 446 458) no Hoare annotation was computed. [2019-11-20 08:39:45,807 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 600) no Hoare annotation was computed. [2019-11-20 08:39:45,808 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 611) no Hoare annotation was computed. [2019-11-20 08:39:45,808 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 622) no Hoare annotation was computed. [2019-11-20 08:39:45,808 INFO L440 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-20 08:39:45,808 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 352) no Hoare annotation was computed. [2019-11-20 08:39:45,808 INFO L444 ceAbstractionStarter]: For program point L348-2(lines 211 588) no Hoare annotation was computed. [2019-11-20 08:39:45,809 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 93) no Hoare annotation was computed. [2019-11-20 08:39:45,809 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 66 675) no Hoare annotation was computed. [2019-11-20 08:39:45,809 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 454) no Hoare annotation was computed. [2019-11-20 08:39:45,809 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 08:39:45,809 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 599) no Hoare annotation was computed. [2019-11-20 08:39:45,809 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 610) no Hoare annotation was computed. [2019-11-20 08:39:45,809 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 621) no Hoare annotation was computed. [2019-11-20 08:39:45,809 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 90) no Hoare annotation was computed. [2019-11-20 08:39:45,809 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 421) no Hoare annotation was computed. [2019-11-20 08:39:45,810 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 223) no Hoare annotation was computed. [2019-11-20 08:39:45,810 INFO L440 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-20 08:39:45,810 INFO L440 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-20 08:39:45,810 INFO L444 ceAbstractionStarter]: For program point L219-2(lines 211 588) no Hoare annotation was computed. [2019-11-20 08:39:45,810 INFO L444 ceAbstractionStarter]: For program point L551(lines 551 555) no Hoare annotation was computed. [2019-11-20 08:39:45,810 INFO L444 ceAbstractionStarter]: For program point L485(lines 485 489) no Hoare annotation was computed. [2019-11-20 08:39:45,810 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 598) no Hoare annotation was computed. [2019-11-20 08:39:45,811 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 609) no Hoare annotation was computed. [2019-11-20 08:39:45,811 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 620) no Hoare annotation was computed. [2019-11-20 08:39:45,811 INFO L440 ceAbstractionStarter]: At program point L552(lines 66 675) the Hoare annotation is: false [2019-11-20 08:39:45,811 INFO L440 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-20 08:39:45,811 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 08:39:45,812 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2019-11-20 08:39:45,812 INFO L447 ceAbstractionStarter]: At program point L686(lines 677 688) the Hoare annotation is: true [2019-11-20 08:39:45,812 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 387) no Hoare annotation was computed. [2019-11-20 08:39:45,812 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-20 08:39:45,812 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 262) no Hoare annotation was computed. [2019-11-20 08:39:45,812 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 323 327) no Hoare annotation was computed. [2019-11-20 08:39:45,812 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 597) no Hoare annotation was computed. [2019-11-20 08:39:45,813 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 608) no Hoare annotation was computed. [2019-11-20 08:39:45,813 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 619) no Hoare annotation was computed. [2019-11-20 08:39:45,813 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-11-20 08:39:45,813 INFO L440 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-20 08:39:45,813 INFO L440 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-20 08:39:45,814 INFO L440 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-20 08:39:45,814 INFO L440 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-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 560) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L292-2(lines 211 588) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 386) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L359-1(lines 359 386) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 596) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 607) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 618) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 383) no Hoare annotation was computed. [2019-11-20 08:39:45,815 INFO L447 ceAbstractionStarter]: At program point L658(lines 100 659) the Hoare annotation is: true [2019-11-20 08:39:45,815 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 426) no Hoare annotation was computed. [2019-11-20 08:39:45,816 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 595) no Hoare annotation was computed. [2019-11-20 08:39:45,816 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 606) no Hoare annotation was computed. [2019-11-20 08:39:45,816 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 617) no Hoare annotation was computed. [2019-11-20 08:39:45,816 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 669) no Hoare annotation was computed. [2019-11-20 08:39:45,816 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 655) no Hoare annotation was computed. [2019-11-20 08:39:45,816 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-20 08:39:45,816 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 382) no Hoare annotation was computed. [2019-11-20 08:39:45,816 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 248) no Hoare annotation was computed. [2019-11-20 08:39:45,816 INFO L440 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-20 08:39:45,816 INFO L440 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-20 08:39:45,816 INFO L444 ceAbstractionStarter]: For program point L231-2(lines 211 588) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 652) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L562(lines 562 566) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L496(lines 496 500) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L562-2(lines 562 566) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L529-2(lines 211 588) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L364(lines 364 368) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L364-2(lines 363 380) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 666) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 638) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L662-2(lines 662 666) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L629-2(lines 628 650) no Hoare annotation was computed. [2019-11-20 08:39:45,817 INFO L444 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-20 08:39:45,818 INFO L444 ceAbstractionStarter]: For program point L332-1(lines 332 341) no Hoare annotation was computed. [2019-11-20 08:39:45,818 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 238) no Hoare annotation was computed. [2019-11-20 08:39:45,818 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 594) no Hoare annotation was computed. [2019-11-20 08:39:45,818 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 605) no Hoare annotation was computed. [2019-11-20 08:39:45,818 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 616) no Hoare annotation was computed. [2019-11-20 08:39:45,818 INFO L440 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-20 08:39:45,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,880 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:45,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:45,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:39:45 BoogieIcfgContainer [2019-11-20 08:39:45,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 08:39:45,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:39:45,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:39:45,911 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:39:45,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:38:36" (3/4) ... [2019-11-20 08:39:45,915 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 08:39:45,946 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 08:39:45,948 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 08:39:46,018 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-20 08:39:46,020 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-20 08:39:46,020 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-20 08:39:46,021 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-20 08:39:46,021 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-20 08:39:46,145 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_59508ee4-99c0-4281-89f3-f5a86cd72e71/bin/uautomizer/witness.graphml [2019-11-20 08:39:46,146 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:39:46,147 INFO L168 Benchmark]: Toolchain (without parser) took 71313.11 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 944.8 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 440.7 MB. Max. memory is 11.5 GB. [2019-11-20 08:39:46,148 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:39:46,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -245.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-20 08:39:46,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:39:46,149 INFO L168 Benchmark]: Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 08:39:46,150 INFO L168 Benchmark]: RCFGBuilder took 887.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:39:46,150 INFO L168 Benchmark]: TraceAbstraction took 69638.13 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-20 08:39:46,151 INFO L168 Benchmark]: Witness Printer took 235.67 ms. Allocated memory is still 3.1 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-11-20 08:39:46,154 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 458.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -245.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 887.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69638.13 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 235.67 ms. Allocated memory is still 3.1 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 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-20 08:39:46,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,181 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-20 08:39:46,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,187 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,188 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,189 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,190 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,191 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,193 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-20 08:39:46,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,205 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-20 08:39:46,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,214 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-20 08:39:46,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-20 08:39:46,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-20 08:39:46,224 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: 69.4s, OverallIterations: 29, TraceHistogramMax: 21, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 41.1s, HoareTripleCheckerStatistics: 5771 SDtfs, 3193 SDslu, 4135 SDs, 0 SdLazy, 4229 SolverSat, 666 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3420 GetRequests, 3362 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.7s 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.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 9456 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 955 NumberOfFragments, 2969 HoareAnnotationTreeSize, 29 FomulaSimplifications, 196409 FormulaSimplificationTreeSizeReduction, 4.3s HoareSimplificationTime, 29 FomulaSimplificationsInter, 91448 FormulaSimplificationTreeSizeReductionInter, 36.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.4s 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...