./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_1a.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_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/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 49452e318e3c9c4b1e038ab7778998d33b04e5b2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:57:36,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:36,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:36,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:36,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:36,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:36,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:36,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:36,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:36,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:36,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:36,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:36,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:36,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:36,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:36,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:36,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:36,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:36,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:36,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:36,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:36,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:36,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:36,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:36,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:36,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:36,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:36,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:36,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:36,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:36,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:36,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:36,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:36,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:36,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:36,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:36,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:36,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:36,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:36,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:36,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:36,529 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-10-22 08:57:36,545 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:36,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:36,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:36,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:36,547 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:36,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:36,547 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:36,547 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:36,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:36,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:36,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:36,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:36,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:36,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:36,549 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-10-22 08:57:36,549 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:36,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:36,549 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:36,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:36,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:36,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:36,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:36,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:36,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:36,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:36,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:36,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:36,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:36,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:36,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:36,553 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_4e0655dd-c584-4a6d-a727-c855c089a2cd/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 -> 49452e318e3c9c4b1e038ab7778998d33b04e5b2 [2019-10-22 08:57:36,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:36,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:36,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:36,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:36,593 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:36,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-10-22 08:57:36,640 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/data/889599f82/a20a00126ac84085b9388521da305c49/FLAG158dd8b48 [2019-10-22 08:57:37,072 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:37,072 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-10-22 08:57:37,086 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/data/889599f82/a20a00126ac84085b9388521da305c49/FLAG158dd8b48 [2019-10-22 08:57:37,100 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/data/889599f82/a20a00126ac84085b9388521da305c49 [2019-10-22 08:57:37,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:37,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:37,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:37,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:37,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:37,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce4328a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37, skipping insertion in model container [2019-10-22 08:57:37,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,119 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:37,169 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:37,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:37,465 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:37,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:37,537 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:37,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37 WrapperNode [2019-10-22 08:57:37,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:37,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:37,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:37,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:37,546 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:57:37" (1/1) ... [2019-10-22 08:57:37,554 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:57:37" (1/1) ... [2019-10-22 08:57:37,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:37,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:37,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:37,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:37,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... [2019-10-22 08:57:37,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:37,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:37,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:37,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:37,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/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:57:37,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:37,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:37,783 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:57:38,330 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 08:57:38,331 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 08:57:38,332 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:38,332 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:57:38,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:38 BoogieIcfgContainer [2019-10-22 08:57:38,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:38,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:38,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:38,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:38,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:37" (1/3) ... [2019-10-22 08:57:38,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4add5b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:38, skipping insertion in model container [2019-10-22 08:57:38,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:37" (2/3) ... [2019-10-22 08:57:38,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4add5b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:38, skipping insertion in model container [2019-10-22 08:57:38,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:38" (3/3) ... [2019-10-22 08:57:38,340 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-10-22 08:57:38,349 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:38,356 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-22 08:57:38,366 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-22 08:57:38,387 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:38,387 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:38,388 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:38,388 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:38,388 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:38,388 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:38,388 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:38,388 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-10-22 08:57:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:57:38,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:38,411 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:57:38,413 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1272360941, now seen corresponding path program 1 times [2019-10-22 08:57:38,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079278413] [2019-10-22 08:57:38,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:38,568 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:57:38,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079278413] [2019-10-22 08:57:38,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:38,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:38,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774725703] [2019-10-22 08:57:38,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:38,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:38,589 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-10-22 08:57:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:38,756 INFO L93 Difference]: Finished difference Result 311 states and 519 transitions. [2019-10-22 08:57:38,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:38,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 08:57:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:38,768 INFO L225 Difference]: With dead ends: 311 [2019-10-22 08:57:38,769 INFO L226 Difference]: Without dead ends: 149 [2019-10-22 08:57:38,771 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:57:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-22 08:57:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-10-22 08:57:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-22 08:57:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-10-22 08:57:38,830 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 17 [2019-10-22 08:57:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:38,830 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-10-22 08:57:38,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-10-22 08:57:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:57:38,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:38,831 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:57:38,832 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1039871977, now seen corresponding path program 1 times [2019-10-22 08:57:38,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162965629] [2019-10-22 08:57:38,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:38,889 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:57:38,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162965629] [2019-10-22 08:57:38,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:38,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:38,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778727679] [2019-10-22 08:57:38,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:38,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:38,892 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 3 states. [2019-10-22 08:57:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:39,030 INFO L93 Difference]: Finished difference Result 301 states and 450 transitions. [2019-10-22 08:57:39,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:39,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-22 08:57:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:39,033 INFO L225 Difference]: With dead ends: 301 [2019-10-22 08:57:39,033 INFO L226 Difference]: Without dead ends: 159 [2019-10-22 08:57:39,034 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:57:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-22 08:57:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2019-10-22 08:57:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-22 08:57:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2019-10-22 08:57:39,057 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2019-10-22 08:57:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:39,059 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2019-10-22 08:57:39,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2019-10-22 08:57:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:57:39,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:39,060 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:57:39,060 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1005531851, now seen corresponding path program 1 times [2019-10-22 08:57:39,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:39,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321261315] [2019-10-22 08:57:39,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,114 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:57:39,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321261315] [2019-10-22 08:57:39,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:39,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:39,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183558799] [2019-10-22 08:57:39,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:39,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:39,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:39,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:39,124 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand 3 states. [2019-10-22 08:57:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:39,252 INFO L93 Difference]: Finished difference Result 303 states and 452 transitions. [2019-10-22 08:57:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:39,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:57:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:39,254 INFO L225 Difference]: With dead ends: 303 [2019-10-22 08:57:39,254 INFO L226 Difference]: Without dead ends: 160 [2019-10-22 08:57:39,255 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:57:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-22 08:57:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2019-10-22 08:57:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-22 08:57:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2019-10-22 08:57:39,277 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2019-10-22 08:57:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:39,278 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2019-10-22 08:57:39,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2019-10-22 08:57:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 08:57:39,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:39,279 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:57:39,279 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash -994026446, now seen corresponding path program 1 times [2019-10-22 08:57:39,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:39,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525876811] [2019-10-22 08:57:39,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,327 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:57:39,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525876811] [2019-10-22 08:57:39,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:39,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:39,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338205391] [2019-10-22 08:57:39,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:39,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:39,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:39,329 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand 3 states. [2019-10-22 08:57:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:39,458 INFO L93 Difference]: Finished difference Result 305 states and 454 transitions. [2019-10-22 08:57:39,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:39,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 08:57:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:39,460 INFO L225 Difference]: With dead ends: 305 [2019-10-22 08:57:39,460 INFO L226 Difference]: Without dead ends: 161 [2019-10-22 08:57:39,461 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:57:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-22 08:57:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2019-10-22 08:57:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-22 08:57:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2019-10-22 08:57:39,473 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2019-10-22 08:57:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:39,474 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2019-10-22 08:57:39,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2019-10-22 08:57:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:57:39,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:39,474 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] [2019-10-22 08:57:39,475 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 461608262, now seen corresponding path program 1 times [2019-10-22 08:57:39,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:39,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197523320] [2019-10-22 08:57:39,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,502 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:57:39,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197523320] [2019-10-22 08:57:39,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:39,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:39,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579984548] [2019-10-22 08:57:39,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:39,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:39,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:39,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:39,504 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand 3 states. [2019-10-22 08:57:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:39,643 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2019-10-22 08:57:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:39,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:57:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:39,645 INFO L225 Difference]: With dead ends: 307 [2019-10-22 08:57:39,645 INFO L226 Difference]: Without dead ends: 162 [2019-10-22 08:57:39,646 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:57:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-22 08:57:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2019-10-22 08:57:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-22 08:57:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2019-10-22 08:57:39,655 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2019-10-22 08:57:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:39,655 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2019-10-22 08:57:39,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2019-10-22 08:57:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 08:57:39,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:39,657 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, 1, 1] [2019-10-22 08:57:39,658 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:39,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,658 INFO L82 PathProgramCache]: Analyzing trace with hash 205704618, now seen corresponding path program 1 times [2019-10-22 08:57:39,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:39,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341030542] [2019-10-22 08:57:39,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,709 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:57:39,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341030542] [2019-10-22 08:57:39,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:39,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:39,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498051834] [2019-10-22 08:57:39,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:39,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:39,711 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand 3 states. [2019-10-22 08:57:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:39,898 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-10-22 08:57:39,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:39,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-22 08:57:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:39,900 INFO L225 Difference]: With dead ends: 330 [2019-10-22 08:57:39,900 INFO L226 Difference]: Without dead ends: 184 [2019-10-22 08:57:39,901 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:57:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-22 08:57:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-10-22 08:57:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-22 08:57:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-10-22 08:57:39,910 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 46 [2019-10-22 08:57:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:39,910 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-10-22 08:57:39,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-10-22 08:57:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-22 08:57:39,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:39,912 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, 1, 1] [2019-10-22 08:57:39,913 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2094953876, now seen corresponding path program 1 times [2019-10-22 08:57:39,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:39,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822223158] [2019-10-22 08:57:39,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,944 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:57:39,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822223158] [2019-10-22 08:57:39,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:39,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:39,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407071891] [2019-10-22 08:57:39,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:39,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:39,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:39,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:39,946 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 3 states. [2019-10-22 08:57:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:40,054 INFO L93 Difference]: Finished difference Result 379 states and 574 transitions. [2019-10-22 08:57:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:40,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-22 08:57:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:40,056 INFO L225 Difference]: With dead ends: 379 [2019-10-22 08:57:40,056 INFO L226 Difference]: Without dead ends: 202 [2019-10-22 08:57:40,057 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:57:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-22 08:57:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-10-22 08:57:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-22 08:57:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2019-10-22 08:57:40,066 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 58 [2019-10-22 08:57:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:40,066 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2019-10-22 08:57:40,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2019-10-22 08:57:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 08:57:40,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:40,068 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, 1, 1] [2019-10-22 08:57:40,068 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2134557448, now seen corresponding path program 1 times [2019-10-22 08:57:40,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149836719] [2019-10-22 08:57:40,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:40,096 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:57:40,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149836719] [2019-10-22 08:57:40,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:40,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:40,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025820970] [2019-10-22 08:57:40,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:40,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:40,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:40,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:40,098 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2019-10-22 08:57:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:40,199 INFO L93 Difference]: Finished difference Result 396 states and 595 transitions. [2019-10-22 08:57:40,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:40,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-22 08:57:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:40,201 INFO L225 Difference]: With dead ends: 396 [2019-10-22 08:57:40,201 INFO L226 Difference]: Without dead ends: 203 [2019-10-22 08:57:40,202 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:57:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-22 08:57:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-10-22 08:57:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-22 08:57:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 301 transitions. [2019-10-22 08:57:40,210 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 301 transitions. Word has length 59 [2019-10-22 08:57:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:40,210 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 301 transitions. [2019-10-22 08:57:40,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 301 transitions. [2019-10-22 08:57:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-22 08:57:40,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:40,212 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, 1, 1] [2019-10-22 08:57:40,213 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1607957135, now seen corresponding path program 1 times [2019-10-22 08:57:40,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739307322] [2019-10-22 08:57:40,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:40,246 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:57:40,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739307322] [2019-10-22 08:57:40,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:40,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:40,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650615423] [2019-10-22 08:57:40,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:40,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:40,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:40,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:40,247 INFO L87 Difference]: Start difference. First operand 201 states and 301 transitions. Second operand 3 states. [2019-10-22 08:57:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:40,372 INFO L93 Difference]: Finished difference Result 439 states and 666 transitions. [2019-10-22 08:57:40,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:40,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-22 08:57:40,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:40,373 INFO L225 Difference]: With dead ends: 439 [2019-10-22 08:57:40,374 INFO L226 Difference]: Without dead ends: 245 [2019-10-22 08:57:40,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-22 08:57:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2019-10-22 08:57:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-22 08:57:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 372 transitions. [2019-10-22 08:57:40,382 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 372 transitions. Word has length 72 [2019-10-22 08:57:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:40,383 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 372 transitions. [2019-10-22 08:57:40,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 372 transitions. [2019-10-22 08:57:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-22 08:57:40,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:40,385 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, 1, 1] [2019-10-22 08:57:40,385 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1882884773, now seen corresponding path program 1 times [2019-10-22 08:57:40,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590931024] [2019-10-22 08:57:40,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:40,435 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:57:40,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590931024] [2019-10-22 08:57:40,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:40,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:40,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339218223] [2019-10-22 08:57:40,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:40,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:40,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:40,440 INFO L87 Difference]: Start difference. First operand 243 states and 372 transitions. Second operand 3 states. [2019-10-22 08:57:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:40,563 INFO L93 Difference]: Finished difference Result 513 states and 788 transitions. [2019-10-22 08:57:40,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:40,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-22 08:57:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:40,565 INFO L225 Difference]: With dead ends: 513 [2019-10-22 08:57:40,565 INFO L226 Difference]: Without dead ends: 277 [2019-10-22 08:57:40,566 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:57:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-22 08:57:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 270. [2019-10-22 08:57:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-22 08:57:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 412 transitions. [2019-10-22 08:57:40,576 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 412 transitions. Word has length 73 [2019-10-22 08:57:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:40,576 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 412 transitions. [2019-10-22 08:57:40,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 412 transitions. [2019-10-22 08:57:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-22 08:57:40,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:40,577 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, 1, 1] [2019-10-22 08:57:40,577 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash -369256571, now seen corresponding path program 1 times [2019-10-22 08:57:40,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214070636] [2019-10-22 08:57:40,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:40,606 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:57:40,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214070636] [2019-10-22 08:57:40,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:40,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:40,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185616418] [2019-10-22 08:57:40,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:40,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:40,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:40,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:40,608 INFO L87 Difference]: Start difference. First operand 270 states and 412 transitions. Second operand 3 states. [2019-10-22 08:57:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:40,730 INFO L93 Difference]: Finished difference Result 536 states and 817 transitions. [2019-10-22 08:57:40,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:40,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-22 08:57:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:40,732 INFO L225 Difference]: With dead ends: 536 [2019-10-22 08:57:40,732 INFO L226 Difference]: Without dead ends: 273 [2019-10-22 08:57:40,733 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:57:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-22 08:57:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-10-22 08:57:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-22 08:57:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-10-22 08:57:40,742 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 73 [2019-10-22 08:57:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:40,742 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-10-22 08:57:40,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-10-22 08:57:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-22 08:57:40,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:40,744 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, 1, 1] [2019-10-22 08:57:40,744 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash -189803919, now seen corresponding path program 1 times [2019-10-22 08:57:40,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028123881] [2019-10-22 08:57:40,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:40,771 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:57:40,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028123881] [2019-10-22 08:57:40,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:40,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:40,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677072523] [2019-10-22 08:57:40,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:40,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:40,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:40,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:40,773 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 3 states. [2019-10-22 08:57:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:40,891 INFO L93 Difference]: Finished difference Result 542 states and 825 transitions. [2019-10-22 08:57:40,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:40,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-22 08:57:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:40,893 INFO L225 Difference]: With dead ends: 542 [2019-10-22 08:57:40,893 INFO L226 Difference]: Without dead ends: 278 [2019-10-22 08:57:40,893 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:57:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-22 08:57:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2019-10-22 08:57:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-22 08:57:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2019-10-22 08:57:40,903 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 74 [2019-10-22 08:57:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:40,903 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2019-10-22 08:57:40,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-10-22 08:57:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-22 08:57:40,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:40,904 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, 1, 1] [2019-10-22 08:57:40,905 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:40,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash 873313086, now seen corresponding path program 1 times [2019-10-22 08:57:40,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102674489] [2019-10-22 08:57:40,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:40,948 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:57:40,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102674489] [2019-10-22 08:57:40,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:40,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:40,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503273896] [2019-10-22 08:57:40,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:40,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:40,949 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 3 states. [2019-10-22 08:57:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:41,100 INFO L93 Difference]: Finished difference Result 582 states and 881 transitions. [2019-10-22 08:57:41,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:41,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-22 08:57:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:41,102 INFO L225 Difference]: With dead ends: 582 [2019-10-22 08:57:41,102 INFO L226 Difference]: Without dead ends: 318 [2019-10-22 08:57:41,103 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:57:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-22 08:57:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2019-10-22 08:57:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-22 08:57:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 478 transitions. [2019-10-22 08:57:41,115 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 478 transitions. Word has length 89 [2019-10-22 08:57:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:41,115 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 478 transitions. [2019-10-22 08:57:41,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 478 transitions. [2019-10-22 08:57:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-22 08:57:41,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:41,119 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, 1, 1, 1] [2019-10-22 08:57:41,119 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:41,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1282770437, now seen corresponding path program 1 times [2019-10-22 08:57:41,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:41,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596394597] [2019-10-22 08:57:41,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:41,166 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:57:41,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596394597] [2019-10-22 08:57:41,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:41,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:41,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900521020] [2019-10-22 08:57:41,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:41,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:41,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:41,167 INFO L87 Difference]: Start difference. First operand 314 states and 478 transitions. Second operand 3 states. [2019-10-22 08:57:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:41,302 INFO L93 Difference]: Finished difference Result 637 states and 972 transitions. [2019-10-22 08:57:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:41,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-10-22 08:57:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:41,304 INFO L225 Difference]: With dead ends: 637 [2019-10-22 08:57:41,304 INFO L226 Difference]: Without dead ends: 328 [2019-10-22 08:57:41,305 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:57:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-22 08:57:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2019-10-22 08:57:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-22 08:57:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 497 transitions. [2019-10-22 08:57:41,316 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 497 transitions. Word has length 90 [2019-10-22 08:57:41,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:41,317 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 497 transitions. [2019-10-22 08:57:41,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 497 transitions. [2019-10-22 08:57:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:57:41,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:41,318 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, 1, 1] [2019-10-22 08:57:41,318 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,319 INFO L82 PathProgramCache]: Analyzing trace with hash 630357241, now seen corresponding path program 1 times [2019-10-22 08:57:41,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:41,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857116267] [2019-10-22 08:57:41,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:41,370 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:57:41,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857116267] [2019-10-22 08:57:41,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:41,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:41,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577368292] [2019-10-22 08:57:41,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:41,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:41,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:41,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:41,372 INFO L87 Difference]: Start difference. First operand 324 states and 497 transitions. Second operand 3 states. [2019-10-22 08:57:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:41,474 INFO L93 Difference]: Finished difference Result 678 states and 1042 transitions. [2019-10-22 08:57:41,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:41,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 08:57:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:41,475 INFO L225 Difference]: With dead ends: 678 [2019-10-22 08:57:41,475 INFO L226 Difference]: Without dead ends: 361 [2019-10-22 08:57:41,476 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:57:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-22 08:57:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-10-22 08:57:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-22 08:57:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 531 transitions. [2019-10-22 08:57:41,487 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 531 transitions. Word has length 99 [2019-10-22 08:57:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:41,488 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 531 transitions. [2019-10-22 08:57:41,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 531 transitions. [2019-10-22 08:57:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 08:57:41,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:41,489 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, 1, 1] [2019-10-22 08:57:41,489 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash 757835045, now seen corresponding path program 1 times [2019-10-22 08:57:41,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:41,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651617748] [2019-10-22 08:57:41,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:41,525 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:57:41,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651617748] [2019-10-22 08:57:41,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:41,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:41,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365303284] [2019-10-22 08:57:41,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:41,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:41,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:41,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:41,530 INFO L87 Difference]: Start difference. First operand 349 states and 531 transitions. Second operand 3 states. [2019-10-22 08:57:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:41,649 INFO L93 Difference]: Finished difference Result 703 states and 1071 transitions. [2019-10-22 08:57:41,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:41,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 08:57:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:41,651 INFO L225 Difference]: With dead ends: 703 [2019-10-22 08:57:41,651 INFO L226 Difference]: Without dead ends: 361 [2019-10-22 08:57:41,652 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:57:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-10-22 08:57:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-10-22 08:57:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-22 08:57:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 526 transitions. [2019-10-22 08:57:41,664 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 526 transitions. Word has length 100 [2019-10-22 08:57:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:41,664 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 526 transitions. [2019-10-22 08:57:41,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 526 transitions. [2019-10-22 08:57:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-22 08:57:41,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:41,666 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, 1, 1] [2019-10-22 08:57:41,666 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:41,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,666 INFO L82 PathProgramCache]: Analyzing trace with hash -927735321, now seen corresponding path program 1 times [2019-10-22 08:57:41,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:41,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4161743] [2019-10-22 08:57:41,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:41,702 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:57:41,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4161743] [2019-10-22 08:57:41,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:41,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:41,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29460894] [2019-10-22 08:57:41,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:41,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:41,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:41,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:41,705 INFO L87 Difference]: Start difference. First operand 349 states and 526 transitions. Second operand 3 states. [2019-10-22 08:57:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:41,830 INFO L93 Difference]: Finished difference Result 718 states and 1081 transitions. [2019-10-22 08:57:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:41,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-10-22 08:57:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:41,832 INFO L225 Difference]: With dead ends: 718 [2019-10-22 08:57:41,832 INFO L226 Difference]: Without dead ends: 376 [2019-10-22 08:57:41,832 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:57:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-22 08:57:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-10-22 08:57:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-22 08:57:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 556 transitions. [2019-10-22 08:57:41,845 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 556 transitions. Word has length 119 [2019-10-22 08:57:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:41,845 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 556 transitions. [2019-10-22 08:57:41,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 556 transitions. [2019-10-22 08:57:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-22 08:57:41,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:41,847 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, 1, 1] [2019-10-22 08:57:41,847 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1207090035, now seen corresponding path program 1 times [2019-10-22 08:57:41,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:41,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300005651] [2019-10-22 08:57:41,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:41,877 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:57:41,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300005651] [2019-10-22 08:57:41,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:41,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:41,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110029977] [2019-10-22 08:57:41,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:41,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:41,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:41,879 INFO L87 Difference]: Start difference. First operand 373 states and 556 transitions. Second operand 3 states. [2019-10-22 08:57:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:42,003 INFO L93 Difference]: Finished difference Result 742 states and 1105 transitions. [2019-10-22 08:57:42,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:42,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-10-22 08:57:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:42,005 INFO L225 Difference]: With dead ends: 742 [2019-10-22 08:57:42,005 INFO L226 Difference]: Without dead ends: 376 [2019-10-22 08:57:42,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-22 08:57:42,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-10-22 08:57:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-22 08:57:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 550 transitions. [2019-10-22 08:57:42,021 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 550 transitions. Word has length 120 [2019-10-22 08:57:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:42,021 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 550 transitions. [2019-10-22 08:57:42,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 550 transitions. [2019-10-22 08:57:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-22 08:57:42,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:42,023 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, 1, 1, 1] [2019-10-22 08:57:42,023 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:42,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash -568364771, now seen corresponding path program 1 times [2019-10-22 08:57:42,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081231214] [2019-10-22 08:57:42,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,073 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:57:42,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081231214] [2019-10-22 08:57:42,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:42,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:42,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429927992] [2019-10-22 08:57:42,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:42,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:42,075 INFO L87 Difference]: Start difference. First operand 373 states and 550 transitions. Second operand 3 states. [2019-10-22 08:57:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:42,205 INFO L93 Difference]: Finished difference Result 784 states and 1155 transitions. [2019-10-22 08:57:42,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:42,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-10-22 08:57:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:42,207 INFO L225 Difference]: With dead ends: 784 [2019-10-22 08:57:42,207 INFO L226 Difference]: Without dead ends: 418 [2019-10-22 08:57:42,208 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:57:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-22 08:57:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2019-10-22 08:57:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-10-22 08:57:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 609 transitions. [2019-10-22 08:57:42,221 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 609 transitions. Word has length 129 [2019-10-22 08:57:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:42,221 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 609 transitions. [2019-10-22 08:57:42,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 609 transitions. [2019-10-22 08:57:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-22 08:57:42,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:42,223 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, 1, 1, 1] [2019-10-22 08:57:42,224 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:42,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,224 INFO L82 PathProgramCache]: Analyzing trace with hash 12959108, now seen corresponding path program 1 times [2019-10-22 08:57:42,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805143340] [2019-10-22 08:57:42,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,253 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:57:42,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805143340] [2019-10-22 08:57:42,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:42,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:42,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352896236] [2019-10-22 08:57:42,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:42,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:42,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:42,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:42,255 INFO L87 Difference]: Start difference. First operand 414 states and 609 transitions. Second operand 3 states. [2019-10-22 08:57:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:42,392 INFO L93 Difference]: Finished difference Result 825 states and 1212 transitions. [2019-10-22 08:57:42,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:42,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-22 08:57:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:42,394 INFO L225 Difference]: With dead ends: 825 [2019-10-22 08:57:42,394 INFO L226 Difference]: Without dead ends: 416 [2019-10-22 08:57:42,395 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:57:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-10-22 08:57:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 412. [2019-10-22 08:57:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-10-22 08:57:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2019-10-22 08:57:42,409 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 130 [2019-10-22 08:57:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:42,410 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2019-10-22 08:57:42,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2019-10-22 08:57:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-22 08:57:42,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:42,411 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, 1, 1] [2019-10-22 08:57:42,412 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:42,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,412 INFO L82 PathProgramCache]: Analyzing trace with hash -637521445, now seen corresponding path program 1 times [2019-10-22 08:57:42,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095503749] [2019-10-22 08:57:42,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,439 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:57:42,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095503749] [2019-10-22 08:57:42,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:42,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:42,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802262356] [2019-10-22 08:57:42,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:42,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:42,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:42,441 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand 3 states. [2019-10-22 08:57:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:42,551 INFO L93 Difference]: Finished difference Result 842 states and 1234 transitions. [2019-10-22 08:57:42,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:42,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-22 08:57:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:42,553 INFO L225 Difference]: With dead ends: 842 [2019-10-22 08:57:42,553 INFO L226 Difference]: Without dead ends: 437 [2019-10-22 08:57:42,554 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:57:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-10-22 08:57:42,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-10-22 08:57:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-10-22 08:57:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 627 transitions. [2019-10-22 08:57:42,568 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 627 transitions. Word has length 140 [2019-10-22 08:57:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:42,568 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 627 transitions. [2019-10-22 08:57:42,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 627 transitions. [2019-10-22 08:57:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-22 08:57:42,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:42,570 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, 1, 1] [2019-10-22 08:57:42,570 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash 871119983, now seen corresponding path program 1 times [2019-10-22 08:57:42,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194655481] [2019-10-22 08:57:42,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,603 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:57:42,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194655481] [2019-10-22 08:57:42,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:42,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:42,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972279768] [2019-10-22 08:57:42,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:42,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:42,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:42,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:42,606 INFO L87 Difference]: Start difference. First operand 433 states and 627 transitions. Second operand 3 states. [2019-10-22 08:57:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:42,729 INFO L93 Difference]: Finished difference Result 863 states and 1249 transitions. [2019-10-22 08:57:42,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:42,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-22 08:57:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:42,731 INFO L225 Difference]: With dead ends: 863 [2019-10-22 08:57:42,731 INFO L226 Difference]: Without dead ends: 437 [2019-10-22 08:57:42,732 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:57:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-10-22 08:57:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-10-22 08:57:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-10-22 08:57:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-10-22 08:57:42,746 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 141 [2019-10-22 08:57:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:42,747 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-10-22 08:57:42,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-10-22 08:57:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 08:57:42,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:42,749 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, 1, 1] [2019-10-22 08:57:42,749 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1128117336, now seen corresponding path program 1 times [2019-10-22 08:57:42,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345747322] [2019-10-22 08:57:42,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-22 08:57:42,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345747322] [2019-10-22 08:57:42,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:42,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:42,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483474918] [2019-10-22 08:57:42,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:42,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:42,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:42,787 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-10-22 08:57:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:42,823 INFO L93 Difference]: Finished difference Result 1279 states and 1823 transitions. [2019-10-22 08:57:42,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:42,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-22 08:57:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:42,826 INFO L225 Difference]: With dead ends: 1279 [2019-10-22 08:57:42,826 INFO L226 Difference]: Without dead ends: 853 [2019-10-22 08:57:42,828 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:57:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-10-22 08:57:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 434. [2019-10-22 08:57:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-10-22 08:57:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2019-10-22 08:57:42,857 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 156 [2019-10-22 08:57:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:42,857 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2019-10-22 08:57:42,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2019-10-22 08:57:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 08:57:42,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:42,859 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, 1, 1] [2019-10-22 08:57:42,860 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:42,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash 386659640, now seen corresponding path program 1 times [2019-10-22 08:57:42,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779039691] [2019-10-22 08:57:42,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,918 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:57:42,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779039691] [2019-10-22 08:57:42,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507217065] [2019-10-22 08:57:42,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/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:57:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:42,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:43,037 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:57:43,038 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:43,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:57:43,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929176995] [2019-10-22 08:57:43,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:43,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:43,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:43,039 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand 4 states. [2019-10-22 08:57:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:43,324 INFO L93 Difference]: Finished difference Result 1355 states and 1932 transitions. [2019-10-22 08:57:43,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:43,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-22 08:57:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:43,328 INFO L225 Difference]: With dead ends: 1355 [2019-10-22 08:57:43,328 INFO L226 Difference]: Without dead ends: 903 [2019-10-22 08:57:43,329 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:57:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-10-22 08:57:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 532. [2019-10-22 08:57:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-10-22 08:57:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 761 transitions. [2019-10-22 08:57:43,352 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 761 transitions. Word has length 156 [2019-10-22 08:57:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:43,353 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 761 transitions. [2019-10-22 08:57:43,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 761 transitions. [2019-10-22 08:57:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-22 08:57:43,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:43,354 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, 1, 1] [2019-10-22 08:57:43,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:43,556 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1891443376, now seen corresponding path program 1 times [2019-10-22 08:57:43,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:43,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19874585] [2019-10-22 08:57:43,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:43,619 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:57:43,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19874585] [2019-10-22 08:57:43,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541429618] [2019-10-22 08:57:43,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/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:57:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:43,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:43,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:43,751 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:57:43,752 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:43,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:57:43,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173836950] [2019-10-22 08:57:43,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:43,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:43,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:43,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:43,753 INFO L87 Difference]: Start difference. First operand 532 states and 761 transitions. Second operand 4 states. [2019-10-22 08:57:44,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:44,075 INFO L93 Difference]: Finished difference Result 1476 states and 2098 transitions. [2019-10-22 08:57:44,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:44,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-22 08:57:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:44,079 INFO L225 Difference]: With dead ends: 1476 [2019-10-22 08:57:44,079 INFO L226 Difference]: Without dead ends: 951 [2019-10-22 08:57:44,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 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:57:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-10-22 08:57:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 587. [2019-10-22 08:57:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-22 08:57:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-10-22 08:57:44,113 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 158 [2019-10-22 08:57:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:44,113 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-10-22 08:57:44,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-10-22 08:57:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-22 08:57:44,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:44,117 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, 1, 1, 1] [2019-10-22 08:57:44,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:44,318 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:44,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,318 INFO L82 PathProgramCache]: Analyzing trace with hash -136801648, now seen corresponding path program 1 times [2019-10-22 08:57:44,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773068909] [2019-10-22 08:57:44,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,414 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:57:44,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773068909] [2019-10-22 08:57:44,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211239527] [2019-10-22 08:57:44,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/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:57:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:44,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:44,519 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:57:44,520 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:44,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:57:44,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382695920] [2019-10-22 08:57:44,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:44,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:44,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:44,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:44,521 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 4 states. [2019-10-22 08:57:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:44,800 INFO L93 Difference]: Finished difference Result 1484 states and 2022 transitions. [2019-10-22 08:57:44,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:44,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-22 08:57:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:44,804 INFO L225 Difference]: With dead ends: 1484 [2019-10-22 08:57:44,804 INFO L226 Difference]: Without dead ends: 897 [2019-10-22 08:57:44,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 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:57:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-10-22 08:57:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 515. [2019-10-22 08:57:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-10-22 08:57:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2019-10-22 08:57:44,829 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 166 [2019-10-22 08:57:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:44,829 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2019-10-22 08:57:44,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2019-10-22 08:57:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-22 08:57:44,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:44,831 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, 1, 1, 1] [2019-10-22 08:57:45,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:45,032 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:45,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1003230858, now seen corresponding path program 1 times [2019-10-22 08:57:45,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:45,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402187611] [2019-10-22 08:57:45,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:45,084 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:57:45,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402187611] [2019-10-22 08:57:45,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:45,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:45,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53133610] [2019-10-22 08:57:45,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:45,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:45,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:45,086 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand 3 states. [2019-10-22 08:57:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:45,122 INFO L93 Difference]: Finished difference Result 1226 states and 1656 transitions. [2019-10-22 08:57:45,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:45,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-22 08:57:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:45,124 INFO L225 Difference]: With dead ends: 1226 [2019-10-22 08:57:45,124 INFO L226 Difference]: Without dead ends: 477 [2019-10-22 08:57:45,125 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:57:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-22 08:57:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-10-22 08:57:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-22 08:57:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 648 transitions. [2019-10-22 08:57:45,146 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 648 transitions. Word has length 168 [2019-10-22 08:57:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:45,146 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 648 transitions. [2019-10-22 08:57:45,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 648 transitions. [2019-10-22 08:57:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-22 08:57:45,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:45,148 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, 1, 1, 1] [2019-10-22 08:57:45,149 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1602987784, now seen corresponding path program 1 times [2019-10-22 08:57:45,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:45,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655990124] [2019-10-22 08:57:45,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:45,192 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:57:45,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655990124] [2019-10-22 08:57:45,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:45,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:45,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998968570] [2019-10-22 08:57:45,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:45,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:45,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:45,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:45,194 INFO L87 Difference]: Start difference. First operand 477 states and 648 transitions. Second operand 3 states. [2019-10-22 08:57:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:45,312 INFO L93 Difference]: Finished difference Result 964 states and 1304 transitions. [2019-10-22 08:57:45,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:45,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-10-22 08:57:45,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:45,314 INFO L225 Difference]: With dead ends: 964 [2019-10-22 08:57:45,314 INFO L226 Difference]: Without dead ends: 482 [2019-10-22 08:57:45,314 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:57:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-22 08:57:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2019-10-22 08:57:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-10-22 08:57:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2019-10-22 08:57:45,334 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 200 [2019-10-22 08:57:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:45,334 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2019-10-22 08:57:45,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2019-10-22 08:57:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-22 08:57:45,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:45,338 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, 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] [2019-10-22 08:57:45,339 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1001955789, now seen corresponding path program 1 times [2019-10-22 08:57:45,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:45,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145902935] [2019-10-22 08:57:45,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-10-22 08:57:45,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145902935] [2019-10-22 08:57:45,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:45,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:45,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513826937] [2019-10-22 08:57:45,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:45,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:45,472 INFO L87 Difference]: Start difference. First operand 478 states and 639 transitions. Second operand 3 states. [2019-10-22 08:57:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:45,596 INFO L93 Difference]: Finished difference Result 985 states and 1310 transitions. [2019-10-22 08:57:45,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:45,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-10-22 08:57:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:45,598 INFO L225 Difference]: With dead ends: 985 [2019-10-22 08:57:45,599 INFO L226 Difference]: Without dead ends: 514 [2019-10-22 08:57:45,599 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:57:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-10-22 08:57:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-10-22 08:57:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-22 08:57:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 678 transitions. [2019-10-22 08:57:45,621 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 678 transitions. Word has length 339 [2019-10-22 08:57:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:45,621 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 678 transitions. [2019-10-22 08:57:45,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 678 transitions. [2019-10-22 08:57:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-22 08:57:45,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:45,627 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, 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] [2019-10-22 08:57:45,627 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1590673358, now seen corresponding path program 1 times [2019-10-22 08:57:45,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:45,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794218197] [2019-10-22 08:57:45,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-22 08:57:45,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794218197] [2019-10-22 08:57:45,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:45,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:45,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187905737] [2019-10-22 08:57:45,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:45,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:45,734 INFO L87 Difference]: Start difference. First operand 512 states and 678 transitions. Second operand 3 states. [2019-10-22 08:57:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:45,857 INFO L93 Difference]: Finished difference Result 1055 states and 1392 transitions. [2019-10-22 08:57:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:45,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-10-22 08:57:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:45,859 INFO L225 Difference]: With dead ends: 1055 [2019-10-22 08:57:45,859 INFO L226 Difference]: Without dead ends: 550 [2019-10-22 08:57:45,860 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:57:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-22 08:57:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-10-22 08:57:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-10-22 08:57:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 719 transitions. [2019-10-22 08:57:45,880 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 719 transitions. Word has length 370 [2019-10-22 08:57:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:45,880 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 719 transitions. [2019-10-22 08:57:45,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 719 transitions. [2019-10-22 08:57:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-10-22 08:57:45,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:45,886 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, 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, 1, 1] [2019-10-22 08:57:45,886 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:45,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:45,886 INFO L82 PathProgramCache]: Analyzing trace with hash 458339096, now seen corresponding path program 1 times [2019-10-22 08:57:45,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:45,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193080066] [2019-10-22 08:57:45,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2019-10-22 08:57:46,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193080066] [2019-10-22 08:57:46,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:46,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:46,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055541808] [2019-10-22 08:57:46,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:46,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:46,106 INFO L87 Difference]: Start difference. First operand 548 states and 719 transitions. Second operand 3 states. [2019-10-22 08:57:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:46,154 INFO L93 Difference]: Finished difference Result 1630 states and 2135 transitions. [2019-10-22 08:57:46,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:46,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-10-22 08:57:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:46,158 INFO L225 Difference]: With dead ends: 1630 [2019-10-22 08:57:46,158 INFO L226 Difference]: Without dead ends: 1089 [2019-10-22 08:57:46,159 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:57:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-22 08:57:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2019-10-22 08:57:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-10-22 08:57:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1426 transitions. [2019-10-22 08:57:46,200 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1426 transitions. Word has length 403 [2019-10-22 08:57:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:46,200 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 1426 transitions. [2019-10-22 08:57:46,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1426 transitions. [2019-10-22 08:57:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-10-22 08:57:46,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:46,206 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, 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, 1, 1] [2019-10-22 08:57:46,206 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-10-22 08:57:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash 747158486, now seen corresponding path program 1 times [2019-10-22 08:57:46,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:46,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794481145] [2019-10-22 08:57:46,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-22 08:57:46,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794481145] [2019-10-22 08:57:46,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519674539] [2019-10-22 08:57:46,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/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:57:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:57:46,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-22 08:57:46,595 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:46,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:57:46,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907139946] [2019-10-22 08:57:46,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:46,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:46,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:46,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:46,598 INFO L87 Difference]: Start difference. First operand 1087 states and 1426 transitions. Second operand 4 states. [2019-10-22 08:57:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:46,888 INFO L93 Difference]: Finished difference Result 2539 states and 3361 transitions. [2019-10-22 08:57:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:46,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-10-22 08:57:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:46,890 INFO L225 Difference]: With dead ends: 2539 [2019-10-22 08:57:46,890 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:57:46,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 405 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:57:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:57:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:57:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:57:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:57:46,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 403 [2019-10-22 08:57:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:46,893 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:46,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:46,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:57:47,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:47,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:57:47,925 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-10-22 08:57:48,382 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-10-22 08:57:48,688 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-10-22 08:57:49,019 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-10-22 08:57:49,240 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-10-22 08:57:49,409 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-10-22 08:57:49,586 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2019-10-22 08:57:49,758 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-10-22 08:57:49,922 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-10-22 08:57:50,122 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-10-22 08:57:50,277 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-10-22 08:57:50,433 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-10-22 08:57:50,585 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 14 [2019-10-22 08:57:50,764 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-10-22 08:57:50,951 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 14 [2019-10-22 08:57:51,198 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-10-22 08:57:52,101 WARN L191 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-10-22 08:57:52,311 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 48 [2019-10-22 08:57:53,165 WARN L191 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-10-22 08:57:53,265 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-10-22 08:57:53,265 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-10-22 08:57:53,265 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-10-22 08:57:53,265 INFO L443 ceAbstractionStarter]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-10-22 08:57:53,265 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-10-22 08:57:53,266 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-10-22 08:57:53,266 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-10-22 08:57:53,266 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-10-22 08:57:53,266 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-10-22 08:57:53,266 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-10-22 08:57:53,266 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-10-22 08:57:53,266 INFO L443 ceAbstractionStarter]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-10-22 08:57:53,266 INFO L443 ceAbstractionStarter]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-10-22 08:57:53,266 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (and (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (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 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))))) (or (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0))) [2019-10-22 08:57:53,267 INFO L439 ceAbstractionStarter]: At program point L103(lines 102 628) the Hoare annotation is: false [2019-10-22 08:57:53,267 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L443 ceAbstractionStarter]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L443 ceAbstractionStarter]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-10-22 08:57:53,267 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-10-22 08:57:53,268 INFO L439 ceAbstractionStarter]: At program point L172(lines 168 606) the Hoare annotation is: (and (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-10-22 08:57:53,268 INFO L439 ceAbstractionStarter]: At program point L139(lines 135 617) the Hoare annotation is: (let ((.cse0 (and (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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0))) [2019-10-22 08:57:53,268 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-10-22 08:57:53,268 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-10-22 08:57:53,268 INFO L439 ceAbstractionStarter]: At program point L404(lines 395 415) the Hoare annotation is: (and (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 08:57:53,268 INFO L443 ceAbstractionStarter]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-10-22 08:57:53,268 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-10-22 08:57:53,268 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-10-22 08:57:53,268 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-10-22 08:57:53,268 INFO L439 ceAbstractionStarter]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L443 ceAbstractionStarter]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-10-22 08:57:53,269 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:53,269 INFO L439 ceAbstractionStarter]: At program point L145(lines 141 615) the Hoare annotation is: (and (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 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L439 ceAbstractionStarter]: At program point L212(lines 105 627) the Hoare annotation is: false [2019-10-22 08:57:53,270 INFO L446 ceAbstractionStarter]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L446 ceAbstractionStarter]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-10-22 08:57:53,270 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-10-22 08:57:53,271 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-10-22 08:57:53,271 INFO L443 ceAbstractionStarter]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-10-22 08:57:53,271 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-10-22 08:57:53,271 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-10-22 08:57:53,271 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-10-22 08:57:53,271 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-10-22 08:57:53,271 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-10-22 08:57:53,271 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-10-22 08:57:53,271 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-10-22 08:57:53,275 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:53,276 INFO L439 ceAbstractionStarter]: At program point L151(lines 147 613) the Hoare annotation is: (and (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 08:57:53,276 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-10-22 08:57:53,276 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:57:53,276 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-10-22 08:57:53,276 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-10-22 08:57:53,276 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-10-22 08:57:53,276 INFO L443 ceAbstractionStarter]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-10-22 08:57:53,277 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-10-22 08:57:53,277 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-10-22 08:57:53,277 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-10-22 08:57:53,277 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-10-22 08:57:53,277 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-10-22 08:57:53,277 INFO L439 ceAbstractionStarter]: At program point L121(lines 117 623) the Hoare annotation is: false [2019-10-22 08:57:53,277 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-10-22 08:57:53,277 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-10-22 08:57:53,277 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-10-22 08:57:53,277 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-10-22 08:57:53,278 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-10-22 08:57:53,278 INFO L443 ceAbstractionStarter]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-10-22 08:57:53,278 INFO L443 ceAbstractionStarter]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-10-22 08:57:53,278 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-10-22 08:57:53,278 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-10-22 08:57:53,278 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-10-22 08:57:53,278 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-10-22 08:57:53,278 INFO L439 ceAbstractionStarter]: At program point L553(lines 65 677) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-10-22 08:57:53,278 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-10-22 08:57:53,279 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:57:53,279 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.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 8656))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-10-22 08:57:53,279 INFO L439 ceAbstractionStarter]: At program point L157(lines 153 611) the Hoare annotation is: (and (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 08:57:53,279 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-10-22 08:57:53,280 INFO L439 ceAbstractionStarter]: At program point L124(lines 123 621) 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 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-10-22 08:57:53,280 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-10-22 08:57:53,280 INFO L443 ceAbstractionStarter]: For program point L258(line 258) no Hoare annotation was computed. [2019-10-22 08:57:53,280 INFO L443 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2019-10-22 08:57:53,281 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-10-22 08:57:53,281 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-10-22 08:57:53,281 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-10-22 08:57:53,281 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-10-22 08:57:53,281 INFO L446 ceAbstractionStarter]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-10-22 08:57:53,281 INFO L443 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-10-22 08:57:53,281 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:57:53,281 INFO L443 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2019-10-22 08:57:53,281 INFO L443 ceAbstractionStarter]: For program point L260-1(line 260) no Hoare annotation was computed. [2019-10-22 08:57:53,282 INFO L439 ceAbstractionStarter]: At program point L591(lines 99 659) the Hoare annotation is: (let ((.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse11 .cse9 .cse10 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse1 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse7 .cse11 .cse9 .cse10) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse10) .cse13))) [2019-10-22 08:57:53,282 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-10-22 08:57:53,282 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-10-22 08:57:53,282 INFO L439 ceAbstractionStarter]: At program point L360(lines 342 378) the Hoare annotation is: (and (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 08:57:53,282 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-10-22 08:57:53,282 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-10-22 08:57:53,283 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-10-22 08:57:53,283 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-10-22 08:57:53,283 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-10-22 08:57:53,283 INFO L443 ceAbstractionStarter]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-10-22 08:57:53,283 INFO L439 ceAbstractionStarter]: At program point L394(lines 385 416) the Hoare annotation is: (and (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 08:57:53,283 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-10-22 08:57:53,284 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (and (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (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 16384))) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0))) [2019-10-22 08:57:53,284 INFO L439 ceAbstractionStarter]: At program point L163(lines 159 609) the Hoare annotation is: (and (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 8529)) (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 08:57:53,284 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-10-22 08:57:53,284 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-10-22 08:57:53,285 INFO L446 ceAbstractionStarter]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-10-22 08:57:53,285 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-10-22 08:57:53,285 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-10-22 08:57:53,285 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-10-22 08:57:53,285 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-10-22 08:57:53,285 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-10-22 08:57:53,285 INFO L439 ceAbstractionStarter]: At program point L99-2(lines 99 659) the Hoare annotation is: (let ((.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse11 .cse9 .cse10 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse1 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse7 .cse11 .cse9 .cse10) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse10) .cse13))) [2019-10-22 08:57:53,286 INFO L439 ceAbstractionStarter]: At program point L166(lines 165 607) 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))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.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 8497))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-10-22 08:57:53,286 INFO L439 ceAbstractionStarter]: At program point L133(lines 126 620) 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 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-10-22 08:57:53,286 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 08:57:53,286 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-10-22 08:57:53,286 INFO L443 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-10-22 08:57:53,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:53 BoogieIcfgContainer [2019-10-22 08:57:53,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:53,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:53,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:53,336 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:53,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:38" (3/4) ... [2019-10-22 08:57:53,341 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:57:53,359 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:57:53,361 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:57:53,478 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4e0655dd-c584-4a6d-a727-c855c089a2cd/bin/uautomizer/witness.graphml [2019-10-22 08:57:53,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:53,479 INFO L168 Benchmark]: Toolchain (without parser) took 16374.91 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 557.8 MB). Free memory was 947.4 MB in the beginning and 898.0 MB in the end (delta: 49.4 MB). Peak memory consumption was 607.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:53,480 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:53,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:53,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.18 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:53,481 INFO L168 Benchmark]: Boogie Preprocessor took 31.70 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:53,481 INFO L168 Benchmark]: RCFGBuilder took 699.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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:53,481 INFO L168 Benchmark]: TraceAbstraction took 15001.25 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.8 MB). Free memory was 1.1 GB in the beginning and 916.7 MB in the end (delta: 152.0 MB). Peak memory consumption was 570.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:53,482 INFO L168 Benchmark]: Witness Printer took 142.46 ms. Allocated memory is still 1.6 GB. Free memory was 916.7 MB in the beginning and 898.0 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:53,483 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 432.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.18 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.70 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 699.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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15001.25 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.8 MB). Free memory was 1.1 GB in the beginning and 916.7 MB in the end (delta: 152.0 MB). Peak memory consumption was 570.5 MB. Max. memory is 11.5 GB. * Witness Printer took 142.46 ms. Allocated memory is still 1.6 GB. Free memory was 916.7 MB in the beginning and 898.0 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 126]: 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__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(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: ((((((((((((((((((!(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 == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit)) || ((((((((((((((((!(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__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((((((((((((((!(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__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) - 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__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((!(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: 153]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 186]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8657) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8576)) && !(s__state == 16384)) || ((((((((!(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: 385]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 198]: Loop Invariant Derived loop invariant: ((8576 <= s__state && (((!(s__state == 8657) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8656)) && !(s__state == 16384)) && !(0 == s__hit)) || (!(s__state == 8576) && 8576 <= s__state && (((!(s__state == 8657) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8656)) && !(s__state == 16384)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 147]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 180]: Loop Invariant Derived loop invariant: ((!(s__state == 8576) && s__state <= 8640) && 8576 <= s__state) || ((s__state <= 8640 && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((!(s__state == 8576) && s__state <= 8640) && 8576 <= s__state) || ((s__state <= 8640 && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) || (!(s__state == 8576) && ((((((((((((!(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)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8657) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0)) || ((((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: 8576 <= s__state && s__state <= 8640 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8529)) && !(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: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8657) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0)) || ((((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480))) || (((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8672) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && 8576 <= s__state) && !(0 == s__hit)) || (!(s__state == 8576) && ((((!(s__state == 8672) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && 8576 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 4 error locations. Result: SAFE, OverallTime: 14.9s, OverallIterations: 32, TraceHistogramMax: 14, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, HoareTripleCheckerStatistics: 5368 SDtfs, 4720 SDslu, 2130 SDs, 0 SdLazy, 3171 SolverSat, 1069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 964 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1087occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 1658 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 206 NumberOfFragments, 1821 HoareAnnotationTreeSize, 29 FomulaSimplifications, 240351 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 29 FomulaSimplificationsInter, 93512 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 5109 NumberOfCodeBlocks, 5109 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5073 ConstructedInterpolants, 0 QuantifiedInterpolants, 1687384 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1558 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 36 InterpolantComputations, 28 PerfectInterpolantSequences, 11171/11219 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...