./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c83e1c64d2af1ac92027e4b29fb95a984369de1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:40,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:40,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:40,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:40,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:40,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:40,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:40,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:40,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:40,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:40,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:40,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:40,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:40,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:40,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:40,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:40,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:40,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:40,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:40,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:40,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:40,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:40,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:40,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:40,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:40,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:40,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:40,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:40,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:40,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:40,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:40,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:40,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:40,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:40,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:40,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:40,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:40,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:40,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:40,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:40,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:40,564 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-10-22 08:59:40,576 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:40,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:40,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:40,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:40,577 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:40,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:40,577 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:40,578 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:40,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:40,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:40,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:40,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:59:40,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:59:40,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:59:40,578 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-10-22 08:59:40,579 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:40,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:40,579 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:40,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:59:40,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:40,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:40,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:59:40,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:59:40,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:59:40,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:40,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:59:40,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:59:40,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:40,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:59:40,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:59:40,582 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/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-10-22 08:59:40,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:40,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:40,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:40,617 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:40,618 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:40,618 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-10-22 08:59:40,660 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/data/9f5600a11/53bf836bada048d09f11f0c6112761f0/FLAG66f9975b3 [2019-10-22 08:59:41,078 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:41,081 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-10-22 08:59:41,091 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/data/9f5600a11/53bf836bada048d09f11f0c6112761f0/FLAG66f9975b3 [2019-10-22 08:59:41,428 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/data/9f5600a11/53bf836bada048d09f11f0c6112761f0 [2019-10-22 08:59:41,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:41,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:41,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:41,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:41,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:41,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a518d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41, skipping insertion in model container [2019-10-22 08:59:41,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,446 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:41,495 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:41,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:41,788 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:41,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:41,889 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:41,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41 WrapperNode [2019-10-22 08:59:41,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:41,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:41,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:41,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:41,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:41,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:41,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:41,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:41,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:41,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:42,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:42,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... [2019-10-22 08:59:42,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:42,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:42,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:42,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:42,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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-10-22 08:59:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:42,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:42,172 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:59:42,717 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 08:59:42,718 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 08:59:42,719 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:42,719 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:59:42,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:42 BoogieIcfgContainer [2019-10-22 08:59:42,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:42,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:59:42,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:59:42,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:59:42,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:59:41" (1/3) ... [2019-10-22 08:59:42,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255d49a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:42, skipping insertion in model container [2019-10-22 08:59:42,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:41" (2/3) ... [2019-10-22 08:59:42,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255d49a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:42, skipping insertion in model container [2019-10-22 08:59:42,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:42" (3/3) ... [2019-10-22 08:59:42,728 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-10-22 08:59:42,737 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:59:42,745 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-10-22 08:59:42,755 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-10-22 08:59:42,780 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:59:42,781 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:59:42,781 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:59:42,781 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:42,781 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:42,781 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:59:42,781 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:42,782 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:59:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-22 08:59:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:59:42,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:42,804 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:42,806 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-10-22 08:59:42,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:42,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967738373] [2019-10-22 08:59:42,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:42,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967738373] [2019-10-22 08:59:42,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:42,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:42,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534789633] [2019-10-22 08:59:42,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:42,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:42,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:42,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:42,969 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-10-22 08:59:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,156 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-10-22 08:59:43,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:43,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 08:59:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:43,169 INFO L225 Difference]: With dead ends: 323 [2019-10-22 08:59:43,169 INFO L226 Difference]: Without dead ends: 155 [2019-10-22 08:59:43,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-22 08:59:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-10-22 08:59:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-22 08:59:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-10-22 08:59:43,211 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-10-22 08:59:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:43,212 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-10-22 08:59:43,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-10-22 08:59:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:59:43,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:43,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,213 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-10-22 08:59:43,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810799740] [2019-10-22 08:59:43,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810799740] [2019-10-22 08:59:43,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:43,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:43,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918771939] [2019-10-22 08:59:43,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:43,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:43,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:43,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:43,274 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-10-22 08:59:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,433 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-10-22 08:59:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:43,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 08:59:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:43,436 INFO L225 Difference]: With dead ends: 313 [2019-10-22 08:59:43,436 INFO L226 Difference]: Without dead ends: 165 [2019-10-22 08:59:43,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-22 08:59:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-10-22 08:59:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 08:59:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-10-22 08:59:43,450 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-10-22 08:59:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:43,451 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-10-22 08:59:43,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-10-22 08:59:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:59:43,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:43,452 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,452 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,452 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-10-22 08:59:43,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770900258] [2019-10-22 08:59:43,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770900258] [2019-10-22 08:59:43,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:43,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:43,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139535017] [2019-10-22 08:59:43,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:43,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:43,502 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-10-22 08:59:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,619 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-10-22 08:59:43,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:43,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 08:59:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:43,621 INFO L225 Difference]: With dead ends: 315 [2019-10-22 08:59:43,621 INFO L226 Difference]: Without dead ends: 166 [2019-10-22 08:59:43,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-22 08:59:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-10-22 08:59:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-22 08:59:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-10-22 08:59:43,638 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-10-22 08:59:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:43,639 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-10-22 08:59:43,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-10-22 08:59:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:59:43,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:43,640 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,640 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-10-22 08:59:43,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997606591] [2019-10-22 08:59:43,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997606591] [2019-10-22 08:59:43,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:43,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:43,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095502509] [2019-10-22 08:59:43,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:43,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:43,711 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-10-22 08:59:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,863 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-10-22 08:59:43,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:43,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:59:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:43,865 INFO L225 Difference]: With dead ends: 317 [2019-10-22 08:59:43,865 INFO L226 Difference]: Without dead ends: 167 [2019-10-22 08:59:43,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-22 08:59:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-10-22 08:59:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-22 08:59:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-10-22 08:59:43,885 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-10-22 08:59:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:43,885 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-10-22 08:59:43,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-10-22 08:59:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:59:43,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:43,886 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,886 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,887 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-10-22 08:59:43,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504609256] [2019-10-22 08:59:43,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504609256] [2019-10-22 08:59:43,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:43,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:43,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171182658] [2019-10-22 08:59:43,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:43,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:43,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:43,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:43,943 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-10-22 08:59:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:44,093 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-10-22 08:59:44,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:44,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 08:59:44,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:44,095 INFO L225 Difference]: With dead ends: 319 [2019-10-22 08:59:44,095 INFO L226 Difference]: Without dead ends: 168 [2019-10-22 08:59:44,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-22 08:59:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-10-22 08:59:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-22 08:59:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-10-22 08:59:44,115 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-10-22 08:59:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:44,116 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-10-22 08:59:44,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-10-22 08:59:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 08:59:44,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:44,117 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:44,118 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-10-22 08:59:44,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800842972] [2019-10-22 08:59:44,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,135 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:59:44,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808946121] [2019-10-22 08:59:44,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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-10-22 08:59:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:44,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:44,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800842972] [2019-10-22 08:59:44,239 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:59:44,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808946121] [2019-10-22 08:59:44,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:44,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:44,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713656064] [2019-10-22 08:59:44,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:44,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:44,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:44,241 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-10-22 08:59:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:44,301 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-10-22 08:59:44,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:44,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 08:59:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:44,303 INFO L225 Difference]: With dead ends: 455 [2019-10-22 08:59:44,303 INFO L226 Difference]: Without dead ends: 303 [2019-10-22 08:59:44,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-10-22 08:59:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-10-22 08:59:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-10-22 08:59:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-10-22 08:59:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-10-22 08:59:44,325 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-10-22 08:59:44,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:44,325 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-10-22 08:59:44,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-10-22 08:59:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 08:59:44,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:44,328 INFO L380 BasicCegarLoop]: trace histogram [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-10-22 08:59:44,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:44,529 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-10-22 08:59:44,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409379683] [2019-10-22 08:59:44,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:44,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409379683] [2019-10-22 08:59:44,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:44,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:44,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578878371] [2019-10-22 08:59:44,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:44,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:44,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:44,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:44,597 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-10-22 08:59:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:44,732 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-10-22 08:59:44,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:44,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 08:59:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:44,734 INFO L225 Difference]: With dead ends: 653 [2019-10-22 08:59:44,734 INFO L226 Difference]: Without dead ends: 361 [2019-10-22 08:59:44,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-22 08:59:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-10-22 08:59:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-22 08:59:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-10-22 08:59:44,750 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-10-22 08:59:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:44,752 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-10-22 08:59:44,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-10-22 08:59:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 08:59:44,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:44,754 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:44,754 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:44,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-10-22 08:59:44,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57384259] [2019-10-22 08:59:44,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,770 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:59:44,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324849421] [2019-10-22 08:59:44,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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-10-22 08:59:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:44,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:44,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57384259] [2019-10-22 08:59:44,843 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:59:44,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324849421] [2019-10-22 08:59:44,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:44,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:44,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179926337] [2019-10-22 08:59:44,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:44,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:44,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:44,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:44,846 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-10-22 08:59:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:44,894 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-10-22 08:59:44,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:44,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-22 08:59:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:44,897 INFO L225 Difference]: With dead ends: 719 [2019-10-22 08:59:44,897 INFO L226 Difference]: Without dead ends: 536 [2019-10-22 08:59:44,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-10-22 08:59:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-22 08:59:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-10-22 08:59:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-10-22 08:59:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-10-22 08:59:44,919 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-10-22 08:59:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:44,920 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-10-22 08:59:44,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-10-22 08:59:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 08:59:44,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:44,924 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-22 08:59:45,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:45,125 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-10-22 08:59:45,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:45,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515075527] [2019-10-22 08:59:45,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:45,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515075527] [2019-10-22 08:59:45,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:45,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:45,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035707957] [2019-10-22 08:59:45,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:45,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:45,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:45,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:45,158 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-10-22 08:59:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:45,289 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-10-22 08:59:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:45,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 08:59:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:45,292 INFO L225 Difference]: With dead ends: 1111 [2019-10-22 08:59:45,292 INFO L226 Difference]: Without dead ends: 586 [2019-10-22 08:59:45,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-22 08:59:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-10-22 08:59:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-22 08:59:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-10-22 08:59:45,315 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-10-22 08:59:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:45,315 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-10-22 08:59:45,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-10-22 08:59:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 08:59:45,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:45,317 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:45,317 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-10-22 08:59:45,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:45,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944292281] [2019-10-22 08:59:45,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:45,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944292281] [2019-10-22 08:59:45,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:45,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:45,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883789662] [2019-10-22 08:59:45,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:45,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:45,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:45,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:45,346 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-10-22 08:59:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:45,476 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-10-22 08:59:45,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:45,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-22 08:59:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:45,479 INFO L225 Difference]: With dead ends: 1162 [2019-10-22 08:59:45,479 INFO L226 Difference]: Without dead ends: 589 [2019-10-22 08:59:45,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-22 08:59:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-10-22 08:59:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-22 08:59:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-10-22 08:59:45,497 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-10-22 08:59:45,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:45,498 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-10-22 08:59:45,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-10-22 08:59:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:59:45,499 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:45,500 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:45,500 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-10-22 08:59:45,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:45,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171910297] [2019-10-22 08:59:45,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:45,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171910297] [2019-10-22 08:59:45,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:45,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:45,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605144204] [2019-10-22 08:59:45,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:45,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:45,540 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-10-22 08:59:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:45,675 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-10-22 08:59:45,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:45,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-22 08:59:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:45,678 INFO L225 Difference]: With dead ends: 1291 [2019-10-22 08:59:45,679 INFO L226 Difference]: Without dead ends: 715 [2019-10-22 08:59:45,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-10-22 08:59:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-10-22 08:59:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-10-22 08:59:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-10-22 08:59:45,701 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-10-22 08:59:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:45,701 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-10-22 08:59:45,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-10-22 08:59:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 08:59:45,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:45,703 INFO L380 BasicCegarLoop]: trace histogram [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-10-22 08:59:45,703 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:45,704 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-10-22 08:59:45,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:45,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162453401] [2019-10-22 08:59:45,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:45,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162453401] [2019-10-22 08:59:45,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:45,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:45,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475309305] [2019-10-22 08:59:45,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:45,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:45,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:45,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:45,739 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-10-22 08:59:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:45,907 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-10-22 08:59:45,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:45,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 08:59:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:45,910 INFO L225 Difference]: With dead ends: 1513 [2019-10-22 08:59:45,910 INFO L226 Difference]: Without dead ends: 811 [2019-10-22 08:59:45,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-10-22 08:59:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-10-22 08:59:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-22 08:59:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-10-22 08:59:45,939 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-10-22 08:59:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:45,939 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-10-22 08:59:45,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-10-22 08:59:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 08:59:45,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:45,941 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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-10-22 08:59:45,941 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-10-22 08:59:45,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:45,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154113734] [2019-10-22 08:59:45,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:45,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:45,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154113734] [2019-10-22 08:59:45,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:45,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:45,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236034103] [2019-10-22 08:59:45,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:45,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:45,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:45,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:45,977 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-10-22 08:59:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:46,119 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-10-22 08:59:46,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:46,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 08:59:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:46,122 INFO L225 Difference]: With dead ends: 1582 [2019-10-22 08:59:46,122 INFO L226 Difference]: Without dead ends: 799 [2019-10-22 08:59:46,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-22 08:59:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-10-22 08:59:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-22 08:59:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-10-22 08:59:46,146 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-10-22 08:59:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:46,147 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-10-22 08:59:46,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-10-22 08:59:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-22 08:59:46,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:46,151 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 08:59:46,151 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-10-22 08:59:46,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865254569] [2019-10-22 08:59:46,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:46,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865254569] [2019-10-22 08:59:46,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:46,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:46,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358167669] [2019-10-22 08:59:46,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:46,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:46,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:46,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:46,191 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-10-22 08:59:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:46,325 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-10-22 08:59:46,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:46,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-22 08:59:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:46,328 INFO L225 Difference]: With dead ends: 1600 [2019-10-22 08:59:46,328 INFO L226 Difference]: Without dead ends: 814 [2019-10-22 08:59:46,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-10-22 08:59:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-10-22 08:59:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-22 08:59:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-10-22 08:59:46,356 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-10-22 08:59:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:46,356 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-10-22 08:59:46,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-10-22 08:59:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 08:59:46,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:46,357 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:46,357 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:46,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,357 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-10-22 08:59:46,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639213576] [2019-10-22 08:59:46,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,366 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:59:46,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155198289] [2019-10-22 08:59:46,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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-10-22 08:59:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:46,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 08:59:46,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639213576] [2019-10-22 08:59:46,426 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:59:46,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155198289] [2019-10-22 08:59:46,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:46,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:46,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244378083] [2019-10-22 08:59:46,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:46,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:46,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:46,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:46,428 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-10-22 08:59:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:46,479 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-10-22 08:59:46,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:46,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-22 08:59:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:46,483 INFO L225 Difference]: With dead ends: 1583 [2019-10-22 08:59:46,483 INFO L226 Difference]: Without dead ends: 1055 [2019-10-22 08:59:46,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-10-22 08:59:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-10-22 08:59:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-10-22 08:59:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-10-22 08:59:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-10-22 08:59:46,519 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-10-22 08:59:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:46,519 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-10-22 08:59:46,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-10-22 08:59:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 08:59:46,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:46,521 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:59:46,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:46,722 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:46,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,722 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-10-22 08:59:46,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429514279] [2019-10-22 08:59:46,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:46,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429514279] [2019-10-22 08:59:46,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:46,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:46,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393079285] [2019-10-22 08:59:46,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:46,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:46,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:46,758 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-10-22 08:59:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:46,922 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-10-22 08:59:46,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:46,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-22 08:59:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:46,926 INFO L225 Difference]: With dead ends: 2279 [2019-10-22 08:59:46,926 INFO L226 Difference]: Without dead ends: 1235 [2019-10-22 08:59:46,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-10-22 08:59:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-10-22 08:59:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-10-22 08:59:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-10-22 08:59:46,965 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-10-22 08:59:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:46,965 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-10-22 08:59:46,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-10-22 08:59:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:59:46,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:46,967 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:59:46,967 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:46,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-10-22 08:59:46,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271280792] [2019-10-22 08:59:46,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:59:47,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271280792] [2019-10-22 08:59:47,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:47,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:47,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866445814] [2019-10-22 08:59:47,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:47,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:47,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:47,014 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-10-22 08:59:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:47,205 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-10-22 08:59:47,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:47,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-22 08:59:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:47,210 INFO L225 Difference]: With dead ends: 2499 [2019-10-22 08:59:47,210 INFO L226 Difference]: Without dead ends: 1275 [2019-10-22 08:59:47,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-10-22 08:59:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-10-22 08:59:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-10-22 08:59:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-10-22 08:59:47,248 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-10-22 08:59:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:47,249 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-10-22 08:59:47,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-10-22 08:59:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 08:59:47,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:47,251 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:47,251 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-10-22 08:59:47,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:47,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518008052] [2019-10-22 08:59:47,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 08:59:47,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518008052] [2019-10-22 08:59:47,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:47,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:47,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650261898] [2019-10-22 08:59:47,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:47,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:47,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:47,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:47,291 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-10-22 08:59:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:47,433 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-10-22 08:59:47,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:47,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-22 08:59:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:47,438 INFO L225 Difference]: With dead ends: 2667 [2019-10-22 08:59:47,439 INFO L226 Difference]: Without dead ends: 1411 [2019-10-22 08:59:47,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-10-22 08:59:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-10-22 08:59:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-22 08:59:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-10-22 08:59:47,481 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-10-22 08:59:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:47,481 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-10-22 08:59:47,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-10-22 08:59:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:59:47,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:47,484 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:47,485 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:47,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-10-22 08:59:47,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:47,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663808846] [2019-10-22 08:59:47,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-22 08:59:47,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663808846] [2019-10-22 08:59:47,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:47,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:47,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485852006] [2019-10-22 08:59:47,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:47,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:47,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:47,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:47,512 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-10-22 08:59:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:47,656 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-10-22 08:59:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:47,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 08:59:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:47,661 INFO L225 Difference]: With dead ends: 2767 [2019-10-22 08:59:47,661 INFO L226 Difference]: Without dead ends: 1411 [2019-10-22 08:59:47,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-10-22 08:59:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-10-22 08:59:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-22 08:59:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-10-22 08:59:47,702 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-10-22 08:59:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:47,702 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-10-22 08:59:47,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-10-22 08:59:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 08:59:47,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:47,706 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-10-22 08:59:47,706 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:47,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-10-22 08:59:47,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:47,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298412745] [2019-10-22 08:59:47,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:47,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:47,720 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:59:47,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797840022] [2019-10-22 08:59:47,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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-10-22 08:59:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:47,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:47,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 08:59:47,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298412745] [2019-10-22 08:59:47,807 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:59:47,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797840022] [2019-10-22 08:59:47,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:47,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:47,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952277381] [2019-10-22 08:59:47,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:47,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:47,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:47,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:47,809 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-10-22 08:59:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:47,992 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-10-22 08:59:47,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:47,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-22 08:59:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:47,997 INFO L225 Difference]: With dead ends: 2755 [2019-10-22 08:59:47,997 INFO L226 Difference]: Without dead ends: 1399 [2019-10-22 08:59:47,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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-10-22 08:59:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-10-22 08:59:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-10-22 08:59:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-10-22 08:59:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-10-22 08:59:48,037 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-10-22 08:59:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:48,037 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-10-22 08:59:48,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-10-22 08:59:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-22 08:59:48,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:48,039 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:48,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:48,240 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:48,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:48,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-10-22 08:59:48,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:48,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381067036] [2019-10-22 08:59:48,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 08:59:48,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381067036] [2019-10-22 08:59:48,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:48,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:48,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493068422] [2019-10-22 08:59:48,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:48,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:48,295 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-10-22 08:59:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:48,440 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-10-22 08:59:48,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:48,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-10-22 08:59:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:48,445 INFO L225 Difference]: With dead ends: 2827 [2019-10-22 08:59:48,445 INFO L226 Difference]: Without dead ends: 1471 [2019-10-22 08:59:48,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-10-22 08:59:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-10-22 08:59:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-10-22 08:59:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-10-22 08:59:48,483 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-10-22 08:59:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:48,484 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-10-22 08:59:48,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-10-22 08:59:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-22 08:59:48,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:48,486 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:48,486 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-10-22 08:59:48,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:48,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226162929] [2019-10-22 08:59:48,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 08:59:48,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226162929] [2019-10-22 08:59:48,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:48,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:48,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140076979] [2019-10-22 08:59:48,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:48,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:48,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:48,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:48,513 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-10-22 08:59:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:48,656 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-10-22 08:59:48,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:48,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-10-22 08:59:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:48,661 INFO L225 Difference]: With dead ends: 2923 [2019-10-22 08:59:48,661 INFO L226 Difference]: Without dead ends: 1471 [2019-10-22 08:59:48,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-10-22 08:59:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-10-22 08:59:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-10-22 08:59:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-10-22 08:59:48,699 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-10-22 08:59:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:48,699 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-10-22 08:59:48,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-10-22 08:59:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-22 08:59:48,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:48,701 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:59:48,701 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:48,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:48,702 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-10-22 08:59:48,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:48,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422567403] [2019-10-22 08:59:48,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 08:59:48,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422567403] [2019-10-22 08:59:48,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:48,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:48,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600230581] [2019-10-22 08:59:48,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:48,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:48,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:48,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:48,735 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-10-22 08:59:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:48,889 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-10-22 08:59:48,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:48,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-22 08:59:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:48,893 INFO L225 Difference]: With dead ends: 3091 [2019-10-22 08:59:48,893 INFO L226 Difference]: Without dead ends: 1639 [2019-10-22 08:59:48,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-10-22 08:59:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-10-22 08:59:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-10-22 08:59:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-10-22 08:59:48,938 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-10-22 08:59:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:48,938 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-10-22 08:59:48,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-10-22 08:59:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-22 08:59:48,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:48,941 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-10-22 08:59:48,941 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-10-22 08:59:48,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:48,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28502043] [2019-10-22 08:59:48,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:48,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 08:59:48,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28502043] [2019-10-22 08:59:48,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:48,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:48,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860402668] [2019-10-22 08:59:48,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:48,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:48,984 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-10-22 08:59:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:49,146 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-10-22 08:59:49,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:49,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-22 08:59:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:49,152 INFO L225 Difference]: With dead ends: 3255 [2019-10-22 08:59:49,152 INFO L226 Difference]: Without dead ends: 1631 [2019-10-22 08:59:49,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-10-22 08:59:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-10-22 08:59:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-10-22 08:59:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-10-22 08:59:49,208 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-10-22 08:59:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:49,208 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-10-22 08:59:49,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-10-22 08:59:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-22 08:59:49,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:49,212 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:49,212 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-10-22 08:59:49,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:49,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928852236] [2019-10-22 08:59:49,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-22 08:59:49,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928852236] [2019-10-22 08:59:49,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:49,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:49,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584395990] [2019-10-22 08:59:49,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:49,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:49,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:49,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:49,275 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-10-22 08:59:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:49,411 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-10-22 08:59:49,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:49,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-10-22 08:59:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:49,418 INFO L225 Difference]: With dead ends: 3323 [2019-10-22 08:59:49,419 INFO L226 Difference]: Without dead ends: 1715 [2019-10-22 08:59:49,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-10-22 08:59:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-10-22 08:59:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-10-22 08:59:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-10-22 08:59:49,461 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-10-22 08:59:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:49,461 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-10-22 08:59:49,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-10-22 08:59:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-22 08:59:49,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:49,464 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:49,464 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-10-22 08:59:49,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:49,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463265555] [2019-10-22 08:59:49,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-22 08:59:49,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463265555] [2019-10-22 08:59:49,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:49,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:49,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482813517] [2019-10-22 08:59:49,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:49,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:49,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:49,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:49,497 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-10-22 08:59:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:49,629 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-10-22 08:59:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:49,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-22 08:59:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:49,634 INFO L225 Difference]: With dead ends: 3407 [2019-10-22 08:59:49,634 INFO L226 Difference]: Without dead ends: 1715 [2019-10-22 08:59:49,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-10-22 08:59:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-10-22 08:59:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-10-22 08:59:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-10-22 08:59:49,678 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-10-22 08:59:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:49,678 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-10-22 08:59:49,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-10-22 08:59:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 08:59:49,680 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:49,681 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:49,681 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:49,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-10-22 08:59:49,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:49,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503908452] [2019-10-22 08:59:49,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-10-22 08:59:49,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503908452] [2019-10-22 08:59:49,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:49,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:49,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630388817] [2019-10-22 08:59:49,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:49,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:49,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:49,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:49,710 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-10-22 08:59:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:49,759 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-10-22 08:59:49,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:49,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-22 08:59:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:49,765 INFO L225 Difference]: With dead ends: 3373 [2019-10-22 08:59:49,765 INFO L226 Difference]: Without dead ends: 1681 [2019-10-22 08:59:49,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-10-22 08:59:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-10-22 08:59:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-10-22 08:59:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-10-22 08:59:49,809 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-10-22 08:59:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:49,809 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-10-22 08:59:49,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-10-22 08:59:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-22 08:59:49,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:49,812 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:49,812 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-10-22 08:59:49,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:49,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060574390] [2019-10-22 08:59:49,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:49,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 08:59:49,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060574390] [2019-10-22 08:59:49,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514313641] [2019-10-22 08:59:49,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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-10-22 08:59:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:59:49,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 08:59:49,954 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:49,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:59:49,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061707472] [2019-10-22 08:59:49,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:49,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:49,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:49,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:49,955 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-10-22 08:59:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:50,345 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-10-22 08:59:50,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:50,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-22 08:59:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:50,353 INFO L225 Difference]: With dead ends: 5291 [2019-10-22 08:59:50,354 INFO L226 Difference]: Without dead ends: 3521 [2019-10-22 08:59:50,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 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-10-22 08:59:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-10-22 08:59:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-10-22 08:59:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-10-22 08:59:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-10-22 08:59:50,423 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-10-22 08:59:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:50,423 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-10-22 08:59:50,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-10-22 08:59:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 08:59:50,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:50,426 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:50,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:50,627 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:50,627 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-10-22 08:59:50,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:50,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518152935] [2019-10-22 08:59:50,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:50,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 08:59:50,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518152935] [2019-10-22 08:59:50,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215130048] [2019-10-22 08:59:50,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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-10-22 08:59:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:50,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:59:50,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-22 08:59:50,762 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:50,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:59:50,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340918236] [2019-10-22 08:59:50,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:50,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:50,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:50,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:50,763 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-10-22 08:59:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:51,110 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-10-22 08:59:51,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:51,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-22 08:59:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:51,116 INFO L225 Difference]: With dead ends: 5632 [2019-10-22 08:59:51,116 INFO L226 Difference]: Without dead ends: 3574 [2019-10-22 08:59:51,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 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-10-22 08:59:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-10-22 08:59:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2575. [2019-10-22 08:59:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2575 states. [2019-10-22 08:59:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3493 transitions. [2019-10-22 08:59:51,190 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3493 transitions. Word has length 156 [2019-10-22 08:59:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:51,190 INFO L462 AbstractCegarLoop]: Abstraction has 2575 states and 3493 transitions. [2019-10-22 08:59:51,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3493 transitions. [2019-10-22 08:59:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-22 08:59:51,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:51,195 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:51,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:51,396 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-10-22 08:59:51,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:51,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945824233] [2019-10-22 08:59:51,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:51,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-22 08:59:51,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945824233] [2019-10-22 08:59:51,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456798980] [2019-10-22 08:59:51,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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-10-22 08:59:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-22 08:59:51,545 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:51,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:59:51,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507381660] [2019-10-22 08:59:51,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:51,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:51,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:51,546 INFO L87 Difference]: Start difference. First operand 2575 states and 3493 transitions. Second operand 4 states. [2019-10-22 08:59:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:51,914 INFO L93 Difference]: Finished difference Result 5967 states and 8033 transitions. [2019-10-22 08:59:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:51,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-22 08:59:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:51,920 INFO L225 Difference]: With dead ends: 5967 [2019-10-22 08:59:51,920 INFO L226 Difference]: Without dead ends: 3371 [2019-10-22 08:59:51,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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-10-22 08:59:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2019-10-22 08:59:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2281. [2019-10-22 08:59:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-10-22 08:59:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3072 transitions. [2019-10-22 08:59:51,987 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3072 transitions. Word has length 163 [2019-10-22 08:59:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:51,988 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 3072 transitions. [2019-10-22 08:59:51,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3072 transitions. [2019-10-22 08:59:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-22 08:59:51,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:51,993 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:52,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:52,193 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-10-22 08:59:52,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670093761] [2019-10-22 08:59:52,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-22 08:59:52,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670093761] [2019-10-22 08:59:52,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:52,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:52,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153768024] [2019-10-22 08:59:52,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:52,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:52,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:52,255 INFO L87 Difference]: Start difference. First operand 2281 states and 3072 transitions. Second operand 3 states. [2019-10-22 08:59:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:52,325 INFO L93 Difference]: Finished difference Result 5499 states and 7335 transitions. [2019-10-22 08:59:52,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:52,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-22 08:59:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:52,332 INFO L225 Difference]: With dead ends: 5499 [2019-10-22 08:59:52,332 INFO L226 Difference]: Without dead ends: 3225 [2019-10-22 08:59:52,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2019-10-22 08:59:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3221. [2019-10-22 08:59:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3221 states. [2019-10-22 08:59:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4261 transitions. [2019-10-22 08:59:52,411 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4261 transitions. Word has length 165 [2019-10-22 08:59:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:52,411 INFO L462 AbstractCegarLoop]: Abstraction has 3221 states and 4261 transitions. [2019-10-22 08:59:52,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4261 transitions. [2019-10-22 08:59:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-22 08:59:52,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:52,416 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:52,416 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,416 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-10-22 08:59:52,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:52,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156926513] [2019-10-22 08:59:52,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:52,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:52,426 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:59:52,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737739555] [2019-10-22 08:59:52,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/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-10-22 08:59:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:59:52,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-22 08:59:52,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156926513] [2019-10-22 08:59:52,522 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:59:52,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737739555] [2019-10-22 08:59:52,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:52,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:52,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146272395] [2019-10-22 08:59:52,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:52,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:52,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:52,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:52,524 INFO L87 Difference]: Start difference. First operand 3221 states and 4261 transitions. Second operand 4 states. [2019-10-22 08:59:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:52,733 INFO L93 Difference]: Finished difference Result 4906 states and 6379 transitions. [2019-10-22 08:59:52,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:52,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-22 08:59:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:52,740 INFO L225 Difference]: With dead ends: 4906 [2019-10-22 08:59:52,740 INFO L226 Difference]: Without dead ends: 4096 [2019-10-22 08:59:52,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2019-10-22 08:59:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3918. [2019-10-22 08:59:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3918 states. [2019-10-22 08:59:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5142 transitions. [2019-10-22 08:59:52,841 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5142 transitions. Word has length 186 [2019-10-22 08:59:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:52,841 INFO L462 AbstractCegarLoop]: Abstraction has 3918 states and 5142 transitions. [2019-10-22 08:59:52,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5142 transitions. [2019-10-22 08:59:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-22 08:59:52,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:52,846 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:53,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:53,046 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-10-22 08:59:53,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:53,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328738108] [2019-10-22 08:59:53,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:53,053 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:59:53,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730493389] [2019-10-22 08:59:53,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:53,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-22 08:59:53,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328738108] [2019-10-22 08:59:53,191 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:59:53,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730493389] [2019-10-22 08:59:53,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:53,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:53,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116059734] [2019-10-22 08:59:53,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:59:53,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:53,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:53,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:53,192 INFO L87 Difference]: Start difference. First operand 3918 states and 5142 transitions. Second operand 5 states. [2019-10-22 08:59:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:53,509 INFO L93 Difference]: Finished difference Result 5803 states and 7575 transitions. [2019-10-22 08:59:53,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:53,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-10-22 08:59:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:53,519 INFO L225 Difference]: With dead ends: 5803 [2019-10-22 08:59:53,519 INFO L226 Difference]: Without dead ends: 5802 [2019-10-22 08:59:53,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2019-10-22 08:59:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 5243. [2019-10-22 08:59:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2019-10-22 08:59:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6898 transitions. [2019-10-22 08:59:53,649 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6898 transitions. Word has length 188 [2019-10-22 08:59:53,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:53,650 INFO L462 AbstractCegarLoop]: Abstraction has 5243 states and 6898 transitions. [2019-10-22 08:59:53,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:59:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6898 transitions. [2019-10-22 08:59:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-22 08:59:53,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:53,653 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:53,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:53,854 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:53,854 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-10-22 08:59:53,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:53,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316231834] [2019-10-22 08:59:53,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:53,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:53,863 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:59:53,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366252587] [2019-10-22 08:59:53,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:53,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:59:53,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:54,057 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 20 [2019-10-22 08:59:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-22 08:59:54,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316231834] [2019-10-22 08:59:54,084 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:59:54,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366252587] [2019-10-22 08:59:54,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:54,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:54,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957493363] [2019-10-22 08:59:54,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:54,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:54,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:54,085 INFO L87 Difference]: Start difference. First operand 5243 states and 6898 transitions. Second operand 4 states. [2019-10-22 08:59:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:54,384 INFO L93 Difference]: Finished difference Result 9754 states and 12848 transitions. [2019-10-22 08:59:54,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:54,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-10-22 08:59:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:54,392 INFO L225 Difference]: With dead ends: 9754 [2019-10-22 08:59:54,392 INFO L226 Difference]: Without dead ends: 5296 [2019-10-22 08:59:54,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2019-10-22 08:59:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 5242. [2019-10-22 08:59:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5242 states. [2019-10-22 08:59:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 6881 transitions. [2019-10-22 08:59:54,545 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 6881 transitions. Word has length 189 [2019-10-22 08:59:54,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:54,546 INFO L462 AbstractCegarLoop]: Abstraction has 5242 states and 6881 transitions. [2019-10-22 08:59:54,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 6881 transitions. [2019-10-22 08:59:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-22 08:59:54,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:54,550 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:54,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:54,751 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:54,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-10-22 08:59:54,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:54,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188787824] [2019-10-22 08:59:54,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:54,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:54,763 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:59:54,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636626917] [2019-10-22 08:59:54,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:54,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:54,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-22 08:59:54,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188787824] [2019-10-22 08:59:54,893 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:59:54,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636626917] [2019-10-22 08:59:54,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:54,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:54,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290232998] [2019-10-22 08:59:54,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:54,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:54,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:54,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:54,894 INFO L87 Difference]: Start difference. First operand 5242 states and 6881 transitions. Second operand 3 states. [2019-10-22 08:59:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:55,095 INFO L93 Difference]: Finished difference Result 10421 states and 13665 transitions. [2019-10-22 08:59:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:55,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-22 08:59:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:55,100 INFO L225 Difference]: With dead ends: 10421 [2019-10-22 08:59:55,101 INFO L226 Difference]: Without dead ends: 3596 [2019-10-22 08:59:55,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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-10-22 08:59:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2019-10-22 08:59:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3587. [2019-10-22 08:59:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3587 states. [2019-10-22 08:59:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4675 transitions. [2019-10-22 08:59:55,193 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4675 transitions. Word has length 196 [2019-10-22 08:59:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:55,193 INFO L462 AbstractCegarLoop]: Abstraction has 3587 states and 4675 transitions. [2019-10-22 08:59:55,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4675 transitions. [2019-10-22 08:59:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-22 08:59:55,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:55,195 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:55,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:55,396 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-10-22 08:59:55,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074311205] [2019-10-22 08:59:55,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-10-22 08:59:55,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074311205] [2019-10-22 08:59:55,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:55,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:55,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202156793] [2019-10-22 08:59:55,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:55,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:55,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:55,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:55,437 INFO L87 Difference]: Start difference. First operand 3587 states and 4675 transitions. Second operand 3 states. [2019-10-22 08:59:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:55,590 INFO L93 Difference]: Finished difference Result 6826 states and 8875 transitions. [2019-10-22 08:59:55,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:55,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-22 08:59:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:55,596 INFO L225 Difference]: With dead ends: 6826 [2019-10-22 08:59:55,601 INFO L226 Difference]: Without dead ends: 3114 [2019-10-22 08:59:55,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2019-10-22 08:59:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3072. [2019-10-22 08:59:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2019-10-22 08:59:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 3966 transitions. [2019-10-22 08:59:55,675 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 3966 transitions. Word has length 197 [2019-10-22 08:59:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:55,676 INFO L462 AbstractCegarLoop]: Abstraction has 3072 states and 3966 transitions. [2019-10-22 08:59:55,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 3966 transitions. [2019-10-22 08:59:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-22 08:59:55,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:55,678 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 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, 1, 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-10-22 08:59:55,678 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-10-22 08:59:55,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861426130] [2019-10-22 08:59:55,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-10-22 08:59:55,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861426130] [2019-10-22 08:59:55,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:55,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:55,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788984764] [2019-10-22 08:59:55,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:55,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:55,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:55,771 INFO L87 Difference]: Start difference. First operand 3072 states and 3966 transitions. Second operand 3 states. [2019-10-22 08:59:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:55,926 INFO L93 Difference]: Finished difference Result 6482 states and 8334 transitions. [2019-10-22 08:59:55,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:55,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-10-22 08:59:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:55,932 INFO L225 Difference]: With dead ends: 6482 [2019-10-22 08:59:55,932 INFO L226 Difference]: Without dead ends: 3432 [2019-10-22 08:59:55,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2019-10-22 08:59:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3412. [2019-10-22 08:59:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3412 states. [2019-10-22 08:59:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 4356 transitions. [2019-10-22 08:59:56,051 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 4356 transitions. Word has length 335 [2019-10-22 08:59:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:56,051 INFO L462 AbstractCegarLoop]: Abstraction has 3412 states and 4356 transitions. [2019-10-22 08:59:56,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 4356 transitions. [2019-10-22 08:59:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-22 08:59:56,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:56,054 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 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, 1, 1, 1, 1, 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-10-22 08:59:56,054 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:56,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-10-22 08:59:56,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:56,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829363856] [2019-10-22 08:59:56,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:56,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:56,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-22 08:59:56,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829363856] [2019-10-22 08:59:56,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:56,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:56,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570425788] [2019-10-22 08:59:56,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:56,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:56,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:56,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:56,163 INFO L87 Difference]: Start difference. First operand 3412 states and 4356 transitions. Second operand 3 states. [2019-10-22 08:59:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:56,330 INFO L93 Difference]: Finished difference Result 7182 states and 9154 transitions. [2019-10-22 08:59:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:56,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-10-22 08:59:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:56,337 INFO L225 Difference]: With dead ends: 7182 [2019-10-22 08:59:56,337 INFO L226 Difference]: Without dead ends: 3792 [2019-10-22 08:59:56,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2019-10-22 08:59:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3772. [2019-10-22 08:59:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3772 states. [2019-10-22 08:59:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 4766 transitions. [2019-10-22 08:59:56,426 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 4766 transitions. Word has length 366 [2019-10-22 08:59:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:56,427 INFO L462 AbstractCegarLoop]: Abstraction has 3772 states and 4766 transitions. [2019-10-22 08:59:56,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 4766 transitions. [2019-10-22 08:59:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-10-22 08:59:56,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:56,430 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:59:56,430 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:59:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:56,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-10-22 08:59:56,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:56,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274467709] [2019-10-22 08:59:56,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:56,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:56,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-22 08:59:56,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274467709] [2019-10-22 08:59:56,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991114271] [2019-10-22 08:59:56,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:56,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:59:56,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-22 08:59:56,816 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:56,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:59:56,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133151274] [2019-10-22 08:59:56,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:56,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:56,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:56,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:56,818 INFO L87 Difference]: Start difference. First operand 3772 states and 4766 transitions. Second operand 4 states. [2019-10-22 08:59:56,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:56,959 INFO L93 Difference]: Finished difference Result 4931 states and 6242 transitions. [2019-10-22 08:59:56,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:56,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-10-22 08:59:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:56,962 INFO L225 Difference]: With dead ends: 4931 [2019-10-22 08:59:56,962 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:59:56,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 401 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-10-22 08:59:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:59:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:59:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:59:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:59:56,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-10-22 08:59:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:56,965 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:56,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:56,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:59:57,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:57,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:59:57,577 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-10-22 08:59:58,634 WARN L191 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 228 [2019-10-22 08:59:59,356 WARN L191 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 229 [2019-10-22 08:59:59,729 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-10-22 08:59:59,984 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-10-22 09:00:00,175 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2019-10-22 09:00:00,371 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-10-22 09:00:00,515 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-10-22 09:00:00,782 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 44 [2019-10-22 09:00:01,045 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 17 [2019-10-22 09:00:01,251 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-10-22 09:00:01,508 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-10-22 09:00:01,633 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-10-22 09:00:02,909 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 195 DAG size of output: 98 [2019-10-22 09:00:03,150 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2019-10-22 09:00:04,324 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 196 DAG size of output: 98 [2019-10-22 09:00:04,543 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-10-22 09:00:04,865 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 39 [2019-10-22 09:00:04,867 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-10-22 09:00:04,867 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-10-22 09:00:04,867 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-10-22 09:00:04,867 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-10-22 09:00:04,867 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-10-22 09:00:04,867 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-10-22 09:00:04,868 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-10-22 09:00:04,868 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 624) the Hoare annotation is: false [2019-10-22 09:00:04,868 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-10-22 09:00:04,868 INFO L443 ceAbstractionStarter]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 09:00:04,868 INFO L443 ceAbstractionStarter]: For program point L501(line 501) no Hoare annotation was computed. [2019-10-22 09:00:04,868 INFO L443 ceAbstractionStarter]: For program point L501-1(line 501) no Hoare annotation was computed. [2019-10-22 09:00:04,868 INFO L443 ceAbstractionStarter]: For program point L501-2(line 501) no Hoare annotation was computed. [2019-10-22 09:00:04,868 INFO L443 ceAbstractionStarter]: For program point L501-3(line 501) no Hoare annotation was computed. [2019-10-22 09:00:04,868 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-10-22 09:00:04,868 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-10-22 09:00:04,869 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-10-22 09:00:04,869 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-10-22 09:00:04,869 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-10-22 09:00:04,869 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-10-22 09:00:04,869 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 602) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-10-22 09:00:04,869 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))))) (or (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))))) [2019-10-22 09:00:04,869 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-10-22 09:00:04,869 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-10-22 09:00:04,869 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-10-22 09:00:04,869 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-10-22 09:00:04,870 INFO L446 ceAbstractionStarter]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-10-22 09:00:04,870 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-10-22 09:00:04,871 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-10-22 09:00:04,872 INFO L439 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-10-22 09:00:04,872 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-10-22 09:00:04,872 INFO L443 ceAbstractionStarter]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 09:00:04,872 INFO L446 ceAbstractionStarter]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-10-22 09:00:04,872 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-10-22 09:00:04,872 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-10-22 09:00:04,872 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-10-22 09:00:04,872 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-10-22 09:00:04,872 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-10-22 09:00:04,872 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:00:04,872 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 611) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-10-22 09:00:04,873 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-10-22 09:00:04,873 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 623) the Hoare annotation is: false [2019-10-22 09:00:04,873 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-10-22 09:00:04,873 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-10-22 09:00:04,873 INFO L443 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-10-22 09:00:04,879 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-10-22 09:00:04,879 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-10-22 09:00:04,879 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-10-22 09:00:04,880 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 09:00:04,881 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 609) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-10-22 09:00:04,881 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 09:00:04,881 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:00:04,881 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-10-22 09:00:04,881 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-10-22 09:00:04,881 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-10-22 09:00:04,881 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-10-22 09:00:04,881 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-10-22 09:00:04,881 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-10-22 09:00:04,881 INFO L439 ceAbstractionStarter]: At program point L550(lines 64 673) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-10-22 09:00:04,881 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 619) the Hoare annotation is: false [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L446 ceAbstractionStarter]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-10-22 09:00:04,882 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:00:04,883 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 09:00:04,884 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse1 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (.cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse0) (and .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (and .cse1 .cse0))) [2019-10-22 09:00:04,884 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 607) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-10-22 09:00:04,884 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-10-22 09:00:04,884 INFO L439 ceAbstractionStarter]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse19 (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse21 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse3 .cse22 .cse4 .cse8 .cse23 .cse9 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse11 .cse12)) (.cse18 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse13 .cse14 .cse15 .cse11) (and .cse16 .cse6 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse16 .cse17 .cse6 .cse13 .cse11 .cse18) (and .cse6 .cse13 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11) (and .cse5 .cse19) (and .cse16 .cse17 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse18) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21 .cse22 .cse23) .cse16) (and .cse0 .cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse15) (and .cse19 .cse18)))) [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-10-22 09:00:04,885 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:00:04,886 INFO L446 ceAbstractionStarter]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-10-22 09:00:04,886 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-10-22 09:00:04,886 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-10-22 09:00:04,886 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-10-22 09:00:04,886 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-10-22 09:00:04,886 INFO L443 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-10-22 09:00:04,886 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-10-22 09:00:04,886 INFO L443 ceAbstractionStarter]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-10-22 09:00:04,887 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (and .cse2 (and .cse1 .cse3 .cse4 .cse5 .cse6)) .cse7)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse6))) [2019-10-22 09:00:04,888 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 605) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-10-22 09:00:04,888 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 09:00:04,888 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-10-22 09:00:04,888 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-10-22 09:00:04,888 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-10-22 09:00:04,888 INFO L443 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-10-22 09:00:04,888 INFO L443 ceAbstractionStarter]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-10-22 09:00:04,889 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-10-22 09:00:04,889 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-10-22 09:00:04,889 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-10-22 09:00:04,889 INFO L443 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-10-22 09:00:04,889 INFO L443 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-10-22 09:00:04,889 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-10-22 09:00:04,889 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-10-22 09:00:04,889 INFO L439 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-10-22 09:00:04,889 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-10-22 09:00:04,889 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-10-22 09:00:04,890 INFO L443 ceAbstractionStarter]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-10-22 09:00:04,890 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-10-22 09:00:04,890 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-10-22 09:00:04,890 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-10-22 09:00:04,890 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse19 (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse21 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse3 .cse22 .cse4 .cse8 .cse23 .cse9 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse11 .cse12)) (.cse18 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse13 .cse14 .cse15 .cse11) (and .cse16 .cse6 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse16 .cse17 .cse6 .cse13 .cse11 .cse18) (and .cse6 .cse13 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11) (and .cse5 .cse19) (and .cse16 .cse17 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse18) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21 .cse22 .cse23) .cse16) (and .cse0 .cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse15) (and .cse19 .cse18)))) [2019-10-22 09:00:04,890 INFO L439 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-10-22 09:00:04,890 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2) (and .cse3 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2))) [2019-10-22 09:00:04,891 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2019-10-22 09:00:04,891 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 09:00:04,891 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-10-22 09:00:04,891 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-10-22 09:00:04,891 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-10-22 09:00:04,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:00:04 BoogieIcfgContainer [2019-10-22 09:00:04,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:00:04,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:04,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:04,944 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:04,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:42" (3/4) ... [2019-10-22 09:00:04,948 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:00:04,965 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 09:00:04,966 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:00:05,080 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_13108ec5-7c5e-477e-8878-5f4278e22e0e/bin/uautomizer/witness.graphml [2019-10-22 09:00:05,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:05,082 INFO L168 Benchmark]: Toolchain (without parser) took 23650.56 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 876.6 MB). Free memory was 944.5 MB in the beginning and 919.9 MB in the end (delta: 24.6 MB). Peak memory consumption was 901.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:05,082 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:05,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:05,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:05,083 INFO L168 Benchmark]: Boogie Preprocessor took 35.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:05,083 INFO L168 Benchmark]: RCFGBuilder took 712.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:05,083 INFO L168 Benchmark]: TraceAbstraction took 22221.84 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 737.1 MB). Free memory was 1.1 GB in the beginning and 946.8 MB in the end (delta: 120.4 MB). Peak memory consumption was 958.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:05,084 INFO L168 Benchmark]: Witness Printer took 136.76 ms. Allocated memory is still 1.9 GB. Free memory was 946.8 MB in the beginning and 919.9 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:05,085 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 457.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 712.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22221.84 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 737.1 MB). Free memory was 1.1 GB in the beginning and 946.8 MB in the end (delta: 120.4 MB). Peak memory consumption was 958.8 MB. Max. memory is 11.5 GB. * Witness Printer took 136.76 ms. Allocated memory is still 1.9 GB. Free memory was 946.8 MB in the beginning and 919.9 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195)) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 16384)) && !(s__state == 8576))) || (((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 16384)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && s__state <= 8640) && 8576 <= s__state) || (((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && s__state <= 8640) && 8576 <= s__state) || (((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195))) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || ((((!(s__state == 8192) && s__state <= 8448) && !(s__state == 8448)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8195))) || (!(s__state == 8576) && (((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((8672 <= s__state && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && blastFlag <= 3)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8576)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195))) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || ((((!(s__state == 8192) && s__state <= 8448) && !(s__state == 8448)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8195))) || (!(s__state == 8576) && (((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((8672 <= s__state && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && blastFlag <= 3)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && !(0 == s__hit)) || (blastFlag <= 3 && (s__s3__tmp__next_state___0 <= 8640 && 8576 <= s__state && (((!(s__state == 8672) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 16384)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 8 error locations. Result: SAFE, OverallTime: 22.1s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.6s, HoareTripleCheckerStatistics: 6988 SDtfs, 5871 SDslu, 3536 SDs, 0 SdLazy, 4214 SolverSat, 1138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1935 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5243occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 4793 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 275 NumberOfFragments, 1948 HoareAnnotationTreeSize, 29 FomulaSimplifications, 223086 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 29 FomulaSimplificationsInter, 46520 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1668610 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3550 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 43 InterpolantComputations, 35 PerfectInterpolantSequences, 10843/10891 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...