./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/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-678e011 [2019-11-20 03:43:03,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:43:03,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:43:03,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:43:03,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:43:03,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:43:03,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:43:03,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:43:03,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:43:03,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:43:03,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:43:03,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:43:03,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:43:03,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:43:03,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:43:03,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:43:03,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:43:03,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:43:03,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:43:03,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:43:03,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:43:03,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:43:03,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:43:03,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:43:03,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:43:03,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:43:03,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:43:03,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:43:03,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:43:03,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:43:03,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:43:03,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:43:03,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:43:03,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:43:03,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:43:03,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:43:03,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:43:03,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:43:03,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:43:03,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:43:03,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:43:03,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-20 03:43:03,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:43:03,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:43:03,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:43:03,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:43:03,863 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:43:03,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:43:03,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:43:03,863 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 03:43:03,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:43:03,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:43:03,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:43:03,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:43:03,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:43:03,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:43:03,865 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-20 03:43:03,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:43:03,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:43:03,866 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:43:03,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:43:03,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:43:03,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:43:03,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:43:03,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:43:03,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:43:03,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:43:03,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:43:03,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:43:03,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:43:03,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:43:03,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:43:03,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/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-11-20 03:43:04,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:43:04,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:43:04,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:43:04,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:43:04,071 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:43:04,072 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-20 03:43:04,129 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/data/9553bf770/e6b8eaf73e4f4db389c92d1e48b80fd6/FLAG88ec055d0 [2019-11-20 03:43:04,512 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:43:04,513 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-20 03:43:04,524 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/data/9553bf770/e6b8eaf73e4f4db389c92d1e48b80fd6/FLAG88ec055d0 [2019-11-20 03:43:04,536 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/data/9553bf770/e6b8eaf73e4f4db389c92d1e48b80fd6 [2019-11-20 03:43:04,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:43:04,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:43:04,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:43:04,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:43:04,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:43:04,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:43:04" (1/1) ... [2019-11-20 03:43:04,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea93fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:04, skipping insertion in model container [2019-11-20 03:43:04,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:43:04" (1/1) ... [2019-11-20 03:43:04,553 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:43:04,589 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:43:04,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:43:04,946 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:43:05,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:43:05,018 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:43:05,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05 WrapperNode [2019-11-20 03:43:05,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:43:05,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:43:05,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:43:05,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:43:05,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... [2019-11-20 03:43:05,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... [2019-11-20 03:43:05,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:43:05,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:43:05,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:43:05,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:43:05,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... [2019-11-20 03:43:05,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... [2019-11-20 03:43:05,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... [2019-11-20 03:43:05,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... [2019-11-20 03:43:05,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... [2019-11-20 03:43:05,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... [2019-11-20 03:43:05,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... [2019-11-20 03:43:05,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:43:05,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:43:05,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:43:05,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:43:05,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:43:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:43:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:43:05,286 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 03:43:05,826 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 03:43:05,826 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 03:43:05,827 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:43:05,828 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:43:05,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:43:05 BoogieIcfgContainer [2019-11-20 03:43:05,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:43:05,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:43:05,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:43:05,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:43:05,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:43:04" (1/3) ... [2019-11-20 03:43:05,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a8132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:43:05, skipping insertion in model container [2019-11-20 03:43:05,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:43:05" (2/3) ... [2019-11-20 03:43:05,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a8132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:43:05, skipping insertion in model container [2019-11-20 03:43:05,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:43:05" (3/3) ... [2019-11-20 03:43:05,835 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-11-20 03:43:05,844 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:43:05,849 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-20 03:43:05,856 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-20 03:43:05,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:43:05,878 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:43:05,879 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:43:05,879 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:43:05,879 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:43:05,879 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:43:05,879 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:43:05,879 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:43:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-20 03:43:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:43:05,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:05,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:43:05,904 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1272360941, now seen corresponding path program 1 times [2019-11-20 03:43:05,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:05,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925480738] [2019-11-20 03:43:05,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:43:06,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925480738] [2019-11-20 03:43:06,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:06,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:06,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365200972] [2019-11-20 03:43:06,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:06,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:06,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:06,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:06,083 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-20 03:43:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:06,354 INFO L93 Difference]: Finished difference Result 311 states and 519 transitions. [2019-11-20 03:43:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:06,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 03:43:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:06,376 INFO L225 Difference]: With dead ends: 311 [2019-11-20 03:43:06,376 INFO L226 Difference]: Without dead ends: 149 [2019-11-20 03:43:06,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-20 03:43:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-20 03:43:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 03:43:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-11-20 03:43:06,451 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 17 [2019-11-20 03:43:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:06,452 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-11-20 03:43:06,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-11-20 03:43:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:43:06,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:06,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:43:06,453 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1039871977, now seen corresponding path program 1 times [2019-11-20 03:43:06,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:06,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056666319] [2019-11-20 03:43:06,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:43:06,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056666319] [2019-11-20 03:43:06,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:06,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:06,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939277268] [2019-11-20 03:43:06,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:06,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:06,525 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 3 states. [2019-11-20 03:43:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:06,687 INFO L93 Difference]: Finished difference Result 301 states and 450 transitions. [2019-11-20 03:43:06,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:06,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 03:43:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:06,691 INFO L225 Difference]: With dead ends: 301 [2019-11-20 03:43:06,691 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 03:43:06,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 03:43:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2019-11-20 03:43:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 03:43:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2019-11-20 03:43:06,715 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2019-11-20 03:43:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:06,716 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2019-11-20 03:43:06,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2019-11-20 03:43:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 03:43:06,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:06,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:43:06,718 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1005531851, now seen corresponding path program 1 times [2019-11-20 03:43:06,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:06,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946243782] [2019-11-20 03:43:06,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:43:06,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946243782] [2019-11-20 03:43:06,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:06,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:06,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931912228] [2019-11-20 03:43:06,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:06,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:06,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:06,796 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand 3 states. [2019-11-20 03:43:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:06,983 INFO L93 Difference]: Finished difference Result 303 states and 452 transitions. [2019-11-20 03:43:06,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:06,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 03:43:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:06,985 INFO L225 Difference]: With dead ends: 303 [2019-11-20 03:43:06,985 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 03:43:06,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 03:43:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2019-11-20 03:43:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-20 03:43:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2019-11-20 03:43:07,014 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2019-11-20 03:43:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:07,014 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2019-11-20 03:43:07,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2019-11-20 03:43:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 03:43:07,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:07,015 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:43:07,016 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:07,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:07,016 INFO L82 PathProgramCache]: Analyzing trace with hash -994026446, now seen corresponding path program 1 times [2019-11-20 03:43:07,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:07,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819439159] [2019-11-20 03:43:07,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:43:07,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819439159] [2019-11-20 03:43:07,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:07,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:07,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903581570] [2019-11-20 03:43:07,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:07,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:07,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:07,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:07,057 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand 3 states. [2019-11-20 03:43:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:07,190 INFO L93 Difference]: Finished difference Result 305 states and 454 transitions. [2019-11-20 03:43:07,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:07,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 03:43:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:07,193 INFO L225 Difference]: With dead ends: 305 [2019-11-20 03:43:07,194 INFO L226 Difference]: Without dead ends: 161 [2019-11-20 03:43:07,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-20 03:43:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2019-11-20 03:43:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-20 03:43:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2019-11-20 03:43:07,218 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2019-11-20 03:43:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:07,218 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2019-11-20 03:43:07,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2019-11-20 03:43:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:43:07,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:07,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:43:07,220 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:07,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash 461608262, now seen corresponding path program 1 times [2019-11-20 03:43:07,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:07,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078579810] [2019-11-20 03:43:07,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:43:07,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078579810] [2019-11-20 03:43:07,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:07,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:07,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453441172] [2019-11-20 03:43:07,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:07,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:07,276 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand 3 states. [2019-11-20 03:43:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:07,444 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2019-11-20 03:43:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:07,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 03:43:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:07,446 INFO L225 Difference]: With dead ends: 307 [2019-11-20 03:43:07,446 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 03:43:07,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 03:43:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2019-11-20 03:43:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-20 03:43:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2019-11-20 03:43:07,459 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2019-11-20 03:43:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:07,459 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2019-11-20 03:43:07,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:07,459 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2019-11-20 03:43:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 03:43:07,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:07,462 INFO L410 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-11-20 03:43:07,462 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:07,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash 205704618, now seen corresponding path program 1 times [2019-11-20 03:43:07,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:07,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30040393] [2019-11-20 03:43:07,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:43:07,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30040393] [2019-11-20 03:43:07,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:07,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:07,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063911080] [2019-11-20 03:43:07,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:07,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:07,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:07,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:07,550 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand 3 states. [2019-11-20 03:43:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:07,728 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-20 03:43:07,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:07,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-20 03:43:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:07,747 INFO L225 Difference]: With dead ends: 330 [2019-11-20 03:43:07,748 INFO L226 Difference]: Without dead ends: 184 [2019-11-20 03:43:07,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-20 03:43:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-20 03:43:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-20 03:43:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-11-20 03:43:07,774 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 46 [2019-11-20 03:43:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:07,775 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-11-20 03:43:07,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-11-20 03:43:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 03:43:07,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:07,781 INFO L410 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-11-20 03:43:07,781 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:07,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2094953876, now seen corresponding path program 1 times [2019-11-20 03:43:07,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:07,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310303261] [2019-11-20 03:43:07,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 03:43:07,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310303261] [2019-11-20 03:43:07,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:07,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:07,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862946649] [2019-11-20 03:43:07,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:07,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:07,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:07,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:07,841 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 3 states. [2019-11-20 03:43:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:07,964 INFO L93 Difference]: Finished difference Result 379 states and 574 transitions. [2019-11-20 03:43:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:07,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-20 03:43:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:07,966 INFO L225 Difference]: With dead ends: 379 [2019-11-20 03:43:07,967 INFO L226 Difference]: Without dead ends: 202 [2019-11-20 03:43:07,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-20 03:43:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-11-20 03:43:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-20 03:43:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2019-11-20 03:43:07,978 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 58 [2019-11-20 03:43:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:07,979 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2019-11-20 03:43:07,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2019-11-20 03:43:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 03:43:07,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:07,986 INFO L410 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-11-20 03:43:07,986 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:07,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:07,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2134557448, now seen corresponding path program 1 times [2019-11-20 03:43:07,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:07,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421842465] [2019-11-20 03:43:07,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 03:43:08,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421842465] [2019-11-20 03:43:08,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:08,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:08,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998093102] [2019-11-20 03:43:08,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:08,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:08,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:08,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:08,030 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2019-11-20 03:43:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:08,159 INFO L93 Difference]: Finished difference Result 396 states and 595 transitions. [2019-11-20 03:43:08,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:08,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-20 03:43:08,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:08,161 INFO L225 Difference]: With dead ends: 396 [2019-11-20 03:43:08,161 INFO L226 Difference]: Without dead ends: 203 [2019-11-20 03:43:08,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-20 03:43:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-11-20 03:43:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-20 03:43:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 301 transitions. [2019-11-20 03:43:08,171 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 301 transitions. Word has length 59 [2019-11-20 03:43:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:08,171 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 301 transitions. [2019-11-20 03:43:08,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 301 transitions. [2019-11-20 03:43:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 03:43:08,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:08,172 INFO L410 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-11-20 03:43:08,173 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:08,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1607957135, now seen corresponding path program 1 times [2019-11-20 03:43:08,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:08,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533882247] [2019-11-20 03:43:08,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 03:43:08,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533882247] [2019-11-20 03:43:08,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:08,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:08,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474537627] [2019-11-20 03:43:08,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:08,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:08,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:08,208 INFO L87 Difference]: Start difference. First operand 201 states and 301 transitions. Second operand 3 states. [2019-11-20 03:43:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:08,369 INFO L93 Difference]: Finished difference Result 439 states and 666 transitions. [2019-11-20 03:43:08,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:08,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 03:43:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:08,371 INFO L225 Difference]: With dead ends: 439 [2019-11-20 03:43:08,372 INFO L226 Difference]: Without dead ends: 245 [2019-11-20 03:43:08,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-20 03:43:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2019-11-20 03:43:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-20 03:43:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 372 transitions. [2019-11-20 03:43:08,384 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 372 transitions. Word has length 72 [2019-11-20 03:43:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:08,384 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 372 transitions. [2019-11-20 03:43:08,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 372 transitions. [2019-11-20 03:43:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 03:43:08,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:08,386 INFO L410 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-11-20 03:43:08,386 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1882884773, now seen corresponding path program 1 times [2019-11-20 03:43:08,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:08,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51335635] [2019-11-20 03:43:08,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 03:43:08,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51335635] [2019-11-20 03:43:08,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:08,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:08,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165702210] [2019-11-20 03:43:08,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:08,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:08,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:08,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:08,449 INFO L87 Difference]: Start difference. First operand 243 states and 372 transitions. Second operand 3 states. [2019-11-20 03:43:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:08,595 INFO L93 Difference]: Finished difference Result 513 states and 788 transitions. [2019-11-20 03:43:08,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:08,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 03:43:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:08,598 INFO L225 Difference]: With dead ends: 513 [2019-11-20 03:43:08,598 INFO L226 Difference]: Without dead ends: 277 [2019-11-20 03:43:08,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-20 03:43:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 270. [2019-11-20 03:43:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-20 03:43:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 412 transitions. [2019-11-20 03:43:08,615 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 412 transitions. Word has length 73 [2019-11-20 03:43:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:08,617 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 412 transitions. [2019-11-20 03:43:08,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 412 transitions. [2019-11-20 03:43:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 03:43:08,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:08,618 INFO L410 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-11-20 03:43:08,618 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash -369256571, now seen corresponding path program 1 times [2019-11-20 03:43:08,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:08,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749899678] [2019-11-20 03:43:08,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 03:43:08,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749899678] [2019-11-20 03:43:08,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:08,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:08,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377092579] [2019-11-20 03:43:08,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:08,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:08,662 INFO L87 Difference]: Start difference. First operand 270 states and 412 transitions. Second operand 3 states. [2019-11-20 03:43:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:08,809 INFO L93 Difference]: Finished difference Result 536 states and 817 transitions. [2019-11-20 03:43:08,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:08,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 03:43:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:08,811 INFO L225 Difference]: With dead ends: 536 [2019-11-20 03:43:08,811 INFO L226 Difference]: Without dead ends: 273 [2019-11-20 03:43:08,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-20 03:43:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-11-20 03:43:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-20 03:43:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-11-20 03:43:08,826 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 73 [2019-11-20 03:43:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:08,826 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-11-20 03:43:08,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-11-20 03:43:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 03:43:08,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:08,829 INFO L410 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-11-20 03:43:08,829 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:08,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:08,830 INFO L82 PathProgramCache]: Analyzing trace with hash -189803919, now seen corresponding path program 1 times [2019-11-20 03:43:08,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:08,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765334104] [2019-11-20 03:43:08,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 03:43:08,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765334104] [2019-11-20 03:43:08,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:08,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:08,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230571627] [2019-11-20 03:43:08,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:08,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:08,886 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 3 states. [2019-11-20 03:43:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:09,033 INFO L93 Difference]: Finished difference Result 542 states and 825 transitions. [2019-11-20 03:43:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:09,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-20 03:43:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:09,035 INFO L225 Difference]: With dead ends: 542 [2019-11-20 03:43:09,035 INFO L226 Difference]: Without dead ends: 278 [2019-11-20 03:43:09,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-20 03:43:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2019-11-20 03:43:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-20 03:43:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2019-11-20 03:43:09,047 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 74 [2019-11-20 03:43:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:09,047 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2019-11-20 03:43:09,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-11-20 03:43:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 03:43:09,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:09,049 INFO L410 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-11-20 03:43:09,049 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:09,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:09,049 INFO L82 PathProgramCache]: Analyzing trace with hash 873313086, now seen corresponding path program 1 times [2019-11-20 03:43:09,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:09,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233466507] [2019-11-20 03:43:09,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 03:43:09,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233466507] [2019-11-20 03:43:09,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:09,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:09,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052230120] [2019-11-20 03:43:09,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:09,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:09,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:09,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,095 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 3 states. [2019-11-20 03:43:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:09,247 INFO L93 Difference]: Finished difference Result 582 states and 881 transitions. [2019-11-20 03:43:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:09,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-20 03:43:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:09,249 INFO L225 Difference]: With dead ends: 582 [2019-11-20 03:43:09,250 INFO L226 Difference]: Without dead ends: 318 [2019-11-20 03:43:09,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-20 03:43:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2019-11-20 03:43:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-20 03:43:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 478 transitions. [2019-11-20 03:43:09,263 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 478 transitions. Word has length 89 [2019-11-20 03:43:09,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:09,263 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 478 transitions. [2019-11-20 03:43:09,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 478 transitions. [2019-11-20 03:43:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 03:43:09,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:09,265 INFO L410 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-11-20 03:43:09,265 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:09,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:09,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1282770437, now seen corresponding path program 1 times [2019-11-20 03:43:09,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:09,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344893440] [2019-11-20 03:43:09,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 03:43:09,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344893440] [2019-11-20 03:43:09,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:09,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:09,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943988502] [2019-11-20 03:43:09,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:09,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:09,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,311 INFO L87 Difference]: Start difference. First operand 314 states and 478 transitions. Second operand 3 states. [2019-11-20 03:43:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:09,479 INFO L93 Difference]: Finished difference Result 637 states and 972 transitions. [2019-11-20 03:43:09,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:09,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-20 03:43:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:09,482 INFO L225 Difference]: With dead ends: 637 [2019-11-20 03:43:09,482 INFO L226 Difference]: Without dead ends: 328 [2019-11-20 03:43:09,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-20 03:43:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2019-11-20 03:43:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-20 03:43:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 497 transitions. [2019-11-20 03:43:09,494 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 497 transitions. Word has length 90 [2019-11-20 03:43:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:09,495 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 497 transitions. [2019-11-20 03:43:09,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 497 transitions. [2019-11-20 03:43:09,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 03:43:09,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:09,496 INFO L410 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-11-20 03:43:09,496 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:09,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:09,496 INFO L82 PathProgramCache]: Analyzing trace with hash 630357241, now seen corresponding path program 1 times [2019-11-20 03:43:09,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:09,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201077632] [2019-11-20 03:43:09,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 03:43:09,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201077632] [2019-11-20 03:43:09,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:09,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:09,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374192539] [2019-11-20 03:43:09,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:09,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:09,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,529 INFO L87 Difference]: Start difference. First operand 324 states and 497 transitions. Second operand 3 states. [2019-11-20 03:43:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:09,669 INFO L93 Difference]: Finished difference Result 678 states and 1042 transitions. [2019-11-20 03:43:09,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:09,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 03:43:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:09,672 INFO L225 Difference]: With dead ends: 678 [2019-11-20 03:43:09,672 INFO L226 Difference]: Without dead ends: 361 [2019-11-20 03:43:09,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-20 03:43:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-20 03:43:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-20 03:43:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 531 transitions. [2019-11-20 03:43:09,686 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 531 transitions. Word has length 99 [2019-11-20 03:43:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:09,686 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 531 transitions. [2019-11-20 03:43:09,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 531 transitions. [2019-11-20 03:43:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 03:43:09,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:09,688 INFO L410 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-11-20 03:43:09,688 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash 757835045, now seen corresponding path program 1 times [2019-11-20 03:43:09,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:09,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180152639] [2019-11-20 03:43:09,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 03:43:09,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180152639] [2019-11-20 03:43:09,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:09,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:09,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556688620] [2019-11-20 03:43:09,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:09,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,717 INFO L87 Difference]: Start difference. First operand 349 states and 531 transitions. Second operand 3 states. [2019-11-20 03:43:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:09,865 INFO L93 Difference]: Finished difference Result 703 states and 1071 transitions. [2019-11-20 03:43:09,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:09,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 03:43:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:09,868 INFO L225 Difference]: With dead ends: 703 [2019-11-20 03:43:09,868 INFO L226 Difference]: Without dead ends: 361 [2019-11-20 03:43:09,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-20 03:43:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-20 03:43:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-20 03:43:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 526 transitions. [2019-11-20 03:43:09,882 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 526 transitions. Word has length 100 [2019-11-20 03:43:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:09,882 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 526 transitions. [2019-11-20 03:43:09,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 526 transitions. [2019-11-20 03:43:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 03:43:09,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:09,884 INFO L410 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-11-20 03:43:09,884 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash -927735321, now seen corresponding path program 1 times [2019-11-20 03:43:09,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:09,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953574692] [2019-11-20 03:43:09,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 03:43:09,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953574692] [2019-11-20 03:43:09,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:09,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:09,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219595017] [2019-11-20 03:43:09,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:09,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:09,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:09,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:09,918 INFO L87 Difference]: Start difference. First operand 349 states and 526 transitions. Second operand 3 states. [2019-11-20 03:43:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:10,050 INFO L93 Difference]: Finished difference Result 718 states and 1081 transitions. [2019-11-20 03:43:10,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:10,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-20 03:43:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:10,053 INFO L225 Difference]: With dead ends: 718 [2019-11-20 03:43:10,053 INFO L226 Difference]: Without dead ends: 376 [2019-11-20 03:43:10,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-20 03:43:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-20 03:43:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-20 03:43:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 556 transitions. [2019-11-20 03:43:10,069 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 556 transitions. Word has length 119 [2019-11-20 03:43:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:10,069 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 556 transitions. [2019-11-20 03:43:10,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 556 transitions. [2019-11-20 03:43:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 03:43:10,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:10,071 INFO L410 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-11-20 03:43:10,071 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1207090035, now seen corresponding path program 1 times [2019-11-20 03:43:10,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:10,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668948222] [2019-11-20 03:43:10,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 03:43:10,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668948222] [2019-11-20 03:43:10,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:10,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:10,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130189470] [2019-11-20 03:43:10,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:10,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:10,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:10,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,111 INFO L87 Difference]: Start difference. First operand 373 states and 556 transitions. Second operand 3 states. [2019-11-20 03:43:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:10,279 INFO L93 Difference]: Finished difference Result 742 states and 1105 transitions. [2019-11-20 03:43:10,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:10,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-20 03:43:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:10,281 INFO L225 Difference]: With dead ends: 742 [2019-11-20 03:43:10,281 INFO L226 Difference]: Without dead ends: 376 [2019-11-20 03:43:10,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-20 03:43:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-20 03:43:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-20 03:43:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 550 transitions. [2019-11-20 03:43:10,295 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 550 transitions. Word has length 120 [2019-11-20 03:43:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:10,295 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 550 transitions. [2019-11-20 03:43:10,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 550 transitions. [2019-11-20 03:43:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-20 03:43:10,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:10,297 INFO L410 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-11-20 03:43:10,297 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:10,297 INFO L82 PathProgramCache]: Analyzing trace with hash -568364771, now seen corresponding path program 1 times [2019-11-20 03:43:10,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:10,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981869785] [2019-11-20 03:43:10,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 03:43:10,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981869785] [2019-11-20 03:43:10,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:10,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:10,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697985382] [2019-11-20 03:43:10,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:10,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:10,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:10,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,342 INFO L87 Difference]: Start difference. First operand 373 states and 550 transitions. Second operand 3 states. [2019-11-20 03:43:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:10,496 INFO L93 Difference]: Finished difference Result 784 states and 1155 transitions. [2019-11-20 03:43:10,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:10,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-20 03:43:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:10,499 INFO L225 Difference]: With dead ends: 784 [2019-11-20 03:43:10,499 INFO L226 Difference]: Without dead ends: 418 [2019-11-20 03:43:10,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-20 03:43:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2019-11-20 03:43:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-20 03:43:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 609 transitions. [2019-11-20 03:43:10,514 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 609 transitions. Word has length 129 [2019-11-20 03:43:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:10,514 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 609 transitions. [2019-11-20 03:43:10,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 609 transitions. [2019-11-20 03:43:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 03:43:10,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:10,516 INFO L410 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-11-20 03:43:10,516 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash 12959108, now seen corresponding path program 1 times [2019-11-20 03:43:10,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:10,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53688907] [2019-11-20 03:43:10,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 03:43:10,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53688907] [2019-11-20 03:43:10,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:10,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:10,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948919016] [2019-11-20 03:43:10,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:10,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:10,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,555 INFO L87 Difference]: Start difference. First operand 414 states and 609 transitions. Second operand 3 states. [2019-11-20 03:43:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:10,706 INFO L93 Difference]: Finished difference Result 825 states and 1212 transitions. [2019-11-20 03:43:10,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:10,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-20 03:43:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:10,709 INFO L225 Difference]: With dead ends: 825 [2019-11-20 03:43:10,709 INFO L226 Difference]: Without dead ends: 416 [2019-11-20 03:43:10,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-20 03:43:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 412. [2019-11-20 03:43:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-20 03:43:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2019-11-20 03:43:10,724 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 130 [2019-11-20 03:43:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:10,724 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2019-11-20 03:43:10,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2019-11-20 03:43:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 03:43:10,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:10,726 INFO L410 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-11-20 03:43:10,726 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -637521445, now seen corresponding path program 1 times [2019-11-20 03:43:10,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:10,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790471925] [2019-11-20 03:43:10,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 03:43:10,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790471925] [2019-11-20 03:43:10,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:10,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:10,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277549730] [2019-11-20 03:43:10,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:10,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,767 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand 3 states. [2019-11-20 03:43:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:10,904 INFO L93 Difference]: Finished difference Result 842 states and 1234 transitions. [2019-11-20 03:43:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:10,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-20 03:43:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:10,907 INFO L225 Difference]: With dead ends: 842 [2019-11-20 03:43:10,907 INFO L226 Difference]: Without dead ends: 437 [2019-11-20 03:43:10,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-20 03:43:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-20 03:43:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-20 03:43:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 627 transitions. [2019-11-20 03:43:10,924 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 627 transitions. Word has length 140 [2019-11-20 03:43:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:10,924 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 627 transitions. [2019-11-20 03:43:10,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 627 transitions. [2019-11-20 03:43:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 03:43:10,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:10,926 INFO L410 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-11-20 03:43:10,926 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash 871119983, now seen corresponding path program 1 times [2019-11-20 03:43:10,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:10,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429917863] [2019-11-20 03:43:10,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 03:43:10,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429917863] [2019-11-20 03:43:10,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:10,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:10,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502887271] [2019-11-20 03:43:10,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:10,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:10,965 INFO L87 Difference]: Start difference. First operand 433 states and 627 transitions. Second operand 3 states. [2019-11-20 03:43:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:11,096 INFO L93 Difference]: Finished difference Result 863 states and 1249 transitions. [2019-11-20 03:43:11,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:11,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-20 03:43:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:11,101 INFO L225 Difference]: With dead ends: 863 [2019-11-20 03:43:11,101 INFO L226 Difference]: Without dead ends: 437 [2019-11-20 03:43:11,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-20 03:43:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-20 03:43:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-20 03:43:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-11-20 03:43:11,117 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 141 [2019-11-20 03:43:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:11,117 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-11-20 03:43:11,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-11-20 03:43:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 03:43:11,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:11,120 INFO L410 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-11-20 03:43:11,120 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1128117336, now seen corresponding path program 1 times [2019-11-20 03:43:11,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:11,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496818735] [2019-11-20 03:43:11,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-20 03:43:11,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496818735] [2019-11-20 03:43:11,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:11,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:43:11,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40646191] [2019-11-20 03:43:11,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:11,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:11,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:11,198 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-11-20 03:43:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:11,233 INFO L93 Difference]: Finished difference Result 1279 states and 1823 transitions. [2019-11-20 03:43:11,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:11,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-20 03:43:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:11,238 INFO L225 Difference]: With dead ends: 1279 [2019-11-20 03:43:11,238 INFO L226 Difference]: Without dead ends: 853 [2019-11-20 03:43:11,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-11-20 03:43:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 434. [2019-11-20 03:43:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-20 03:43:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2019-11-20 03:43:11,259 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 156 [2019-11-20 03:43:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:11,259 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2019-11-20 03:43:11,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2019-11-20 03:43:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 03:43:11,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:11,261 INFO L410 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-11-20 03:43:11,262 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash 386659640, now seen corresponding path program 1 times [2019-11-20 03:43:11,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:11,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219673717] [2019-11-20 03:43:11,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 03:43:11,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219673717] [2019-11-20 03:43:11,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832727661] [2019-11-20 03:43:11,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:43:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:11,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:43:11,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:43:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 03:43:11,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:43:11,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:43:11,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835322311] [2019-11-20 03:43:11,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:43:11,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:11,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:43:11,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:43:11,492 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand 4 states. [2019-11-20 03:43:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:11,871 INFO L93 Difference]: Finished difference Result 1355 states and 1932 transitions. [2019-11-20 03:43:11,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:43:11,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-20 03:43:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:11,877 INFO L225 Difference]: With dead ends: 1355 [2019-11-20 03:43:11,877 INFO L226 Difference]: Without dead ends: 903 [2019-11-20 03:43:11,878 INFO L630 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-11-20 03:43:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-20 03:43:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 532. [2019-11-20 03:43:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-20 03:43:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 761 transitions. [2019-11-20 03:43:11,905 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 761 transitions. Word has length 156 [2019-11-20 03:43:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:11,906 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 761 transitions. [2019-11-20 03:43:11,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:43:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 761 transitions. [2019-11-20 03:43:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 03:43:11,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:11,909 INFO L410 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-11-20 03:43:12,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:43:12,113 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:12,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:12,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1891443376, now seen corresponding path program 1 times [2019-11-20 03:43:12,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:12,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633251588] [2019-11-20 03:43:12,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 03:43:12,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633251588] [2019-11-20 03:43:12,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262181725] [2019-11-20 03:43:12,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:43:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:12,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:43:12,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:43:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 03:43:12,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:43:12,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:43:12,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276051547] [2019-11-20 03:43:12,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:43:12,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:43:12,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:43:12,324 INFO L87 Difference]: Start difference. First operand 532 states and 761 transitions. Second operand 4 states. [2019-11-20 03:43:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:12,700 INFO L93 Difference]: Finished difference Result 1476 states and 2098 transitions. [2019-11-20 03:43:12,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:43:12,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-20 03:43:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:12,705 INFO L225 Difference]: With dead ends: 1476 [2019-11-20 03:43:12,706 INFO L226 Difference]: Without dead ends: 951 [2019-11-20 03:43:12,706 INFO L630 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-11-20 03:43:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-11-20 03:43:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 587. [2019-11-20 03:43:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-20 03:43:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-11-20 03:43:12,735 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 158 [2019-11-20 03:43:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:12,736 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-11-20 03:43:12,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:43:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-11-20 03:43:12,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-20 03:43:12,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:12,739 INFO L410 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-11-20 03:43:12,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:43:12,945 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash -136801648, now seen corresponding path program 1 times [2019-11-20 03:43:12,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:12,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043315883] [2019-11-20 03:43:12,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 03:43:13,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043315883] [2019-11-20 03:43:13,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789415363] [2019-11-20 03:43:13,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:43:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:13,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:43:13,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:43:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 03:43:13,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:43:13,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:43:13,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058182122] [2019-11-20 03:43:13,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:43:13,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:43:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:43:13,117 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 4 states. [2019-11-20 03:43:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:13,432 INFO L93 Difference]: Finished difference Result 1484 states and 2022 transitions. [2019-11-20 03:43:13,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:43:13,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-20 03:43:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:13,438 INFO L225 Difference]: With dead ends: 1484 [2019-11-20 03:43:13,438 INFO L226 Difference]: Without dead ends: 897 [2019-11-20 03:43:13,439 INFO L630 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-11-20 03:43:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-20 03:43:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 515. [2019-11-20 03:43:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-20 03:43:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2019-11-20 03:43:13,462 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 166 [2019-11-20 03:43:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:13,463 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2019-11-20 03:43:13,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:43:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2019-11-20 03:43:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 03:43:13,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:13,465 INFO L410 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-11-20 03:43:13,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:43:13,677 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:13,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1003230858, now seen corresponding path program 1 times [2019-11-20 03:43:13,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:13,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240247275] [2019-11-20 03:43:13,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 03:43:13,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240247275] [2019-11-20 03:43:13,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:13,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:43:13,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406514849] [2019-11-20 03:43:13,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:13,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:13,740 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand 3 states. [2019-11-20 03:43:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:13,777 INFO L93 Difference]: Finished difference Result 1226 states and 1656 transitions. [2019-11-20 03:43:13,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:13,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-20 03:43:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:13,780 INFO L225 Difference]: With dead ends: 1226 [2019-11-20 03:43:13,781 INFO L226 Difference]: Without dead ends: 477 [2019-11-20 03:43:13,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-20 03:43:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-11-20 03:43:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-11-20 03:43:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 648 transitions. [2019-11-20 03:43:13,802 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 648 transitions. Word has length 168 [2019-11-20 03:43:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:13,803 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 648 transitions. [2019-11-20 03:43:13,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 648 transitions. [2019-11-20 03:43:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-20 03:43:13,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:13,806 INFO L410 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-11-20 03:43:13,806 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:13,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1602987784, now seen corresponding path program 1 times [2019-11-20 03:43:13,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:13,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344845202] [2019-11-20 03:43:13,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 03:43:13,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344845202] [2019-11-20 03:43:13,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:13,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:43:13,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404552801] [2019-11-20 03:43:13,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:13,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:13,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:13,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:13,864 INFO L87 Difference]: Start difference. First operand 477 states and 648 transitions. Second operand 3 states. [2019-11-20 03:43:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:14,019 INFO L93 Difference]: Finished difference Result 964 states and 1304 transitions. [2019-11-20 03:43:14,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:14,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-20 03:43:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:14,022 INFO L225 Difference]: With dead ends: 964 [2019-11-20 03:43:14,022 INFO L226 Difference]: Without dead ends: 482 [2019-11-20 03:43:14,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-20 03:43:14,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2019-11-20 03:43:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-20 03:43:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2019-11-20 03:43:14,041 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 200 [2019-11-20 03:43:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:14,042 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2019-11-20 03:43:14,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2019-11-20 03:43:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-20 03:43:14,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:14,047 INFO L410 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-11-20 03:43:14,047 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1001955789, now seen corresponding path program 1 times [2019-11-20 03:43:14,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:14,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137676658] [2019-11-20 03:43:14,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-11-20 03:43:14,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137676658] [2019-11-20 03:43:14,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:14,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:43:14,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131806332] [2019-11-20 03:43:14,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:14,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:14,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:14,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:14,178 INFO L87 Difference]: Start difference. First operand 478 states and 639 transitions. Second operand 3 states. [2019-11-20 03:43:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:14,314 INFO L93 Difference]: Finished difference Result 985 states and 1310 transitions. [2019-11-20 03:43:14,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:14,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-11-20 03:43:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:14,317 INFO L225 Difference]: With dead ends: 985 [2019-11-20 03:43:14,317 INFO L226 Difference]: Without dead ends: 514 [2019-11-20 03:43:14,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-20 03:43:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-11-20 03:43:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-20 03:43:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 678 transitions. [2019-11-20 03:43:14,340 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 678 transitions. Word has length 339 [2019-11-20 03:43:14,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:14,341 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 678 transitions. [2019-11-20 03:43:14,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 678 transitions. [2019-11-20 03:43:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-20 03:43:14,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:14,347 INFO L410 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-11-20 03:43:14,348 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:14,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1590673358, now seen corresponding path program 1 times [2019-11-20 03:43:14,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:14,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274311017] [2019-11-20 03:43:14,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-11-20 03:43:14,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274311017] [2019-11-20 03:43:14,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:14,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:43:14,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617609615] [2019-11-20 03:43:14,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:14,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:14,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:14,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:14,489 INFO L87 Difference]: Start difference. First operand 512 states and 678 transitions. Second operand 3 states. [2019-11-20 03:43:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:14,639 INFO L93 Difference]: Finished difference Result 1055 states and 1392 transitions. [2019-11-20 03:43:14,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:14,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-11-20 03:43:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:14,643 INFO L225 Difference]: With dead ends: 1055 [2019-11-20 03:43:14,643 INFO L226 Difference]: Without dead ends: 550 [2019-11-20 03:43:14,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-20 03:43:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-11-20 03:43:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-20 03:43:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 719 transitions. [2019-11-20 03:43:14,671 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 719 transitions. Word has length 370 [2019-11-20 03:43:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:14,672 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 719 transitions. [2019-11-20 03:43:14,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 719 transitions. [2019-11-20 03:43:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-20 03:43:14,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:14,680 INFO L410 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-11-20 03:43:14,680 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:14,681 INFO L82 PathProgramCache]: Analyzing trace with hash 458339096, now seen corresponding path program 1 times [2019-11-20 03:43:14,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:14,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607410084] [2019-11-20 03:43:14,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2019-11-20 03:43:14,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607410084] [2019-11-20 03:43:14,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:43:14,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:43:14,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291819589] [2019-11-20 03:43:14,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:43:14,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:14,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:43:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:14,899 INFO L87 Difference]: Start difference. First operand 548 states and 719 transitions. Second operand 3 states. [2019-11-20 03:43:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:14,949 INFO L93 Difference]: Finished difference Result 1630 states and 2135 transitions. [2019-11-20 03:43:14,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:43:14,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-11-20 03:43:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:14,956 INFO L225 Difference]: With dead ends: 1630 [2019-11-20 03:43:14,956 INFO L226 Difference]: Without dead ends: 1089 [2019-11-20 03:43:14,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:43:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-11-20 03:43:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2019-11-20 03:43:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-11-20 03:43:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1426 transitions. [2019-11-20 03:43:14,998 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1426 transitions. Word has length 403 [2019-11-20 03:43:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:14,999 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 1426 transitions. [2019-11-20 03:43:14,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:43:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1426 transitions. [2019-11-20 03:43:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-20 03:43:15,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:43:15,006 INFO L410 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-11-20 03:43:15,006 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 03:43:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:43:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash 747158486, now seen corresponding path program 1 times [2019-11-20 03:43:15,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:43:15,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880704166] [2019-11-20 03:43:15,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:43:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-20 03:43:15,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880704166] [2019-11-20 03:43:15,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097202863] [2019-11-20 03:43:15,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:43:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:43:15,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:43:15,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:43:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-20 03:43:15,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:43:15,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 03:43:15,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893362948] [2019-11-20 03:43:15,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:43:15,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:43:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:43:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:43:15,451 INFO L87 Difference]: Start difference. First operand 1087 states and 1426 transitions. Second operand 4 states. [2019-11-20 03:43:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:43:15,718 INFO L93 Difference]: Finished difference Result 2539 states and 3361 transitions. [2019-11-20 03:43:15,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:43:15,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-11-20 03:43:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:43:15,719 INFO L225 Difference]: With dead ends: 2539 [2019-11-20 03:43:15,719 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:43:15,722 INFO L630 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-11-20 03:43:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:43:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:43:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:43:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:43:15,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 403 [2019-11-20 03:43:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:43:15,723 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:43:15,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:43:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:43:15,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:43:15,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:43:15,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:43:16,778 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-20 03:43:17,203 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-20 03:43:17,544 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-20 03:43:17,969 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-11-20 03:43:18,279 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-20 03:43:18,508 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-20 03:43:18,772 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2019-11-20 03:43:18,987 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-20 03:43:19,239 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-20 03:43:19,475 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-20 03:43:19,665 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-20 03:43:19,839 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-20 03:43:19,973 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 14 [2019-11-20 03:43:20,121 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-20 03:43:20,295 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 14 [2019-11-20 03:43:20,552 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-11-20 03:43:21,779 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-20 03:43:21,906 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 6 [2019-11-20 03:43:22,120 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 48 [2019-11-20 03:43:23,248 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-20 03:43:23,371 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-20 03:43:23,373 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-20 03:43:23,373 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-11-20 03:43:23,374 INFO L444 ceAbstractionStarter]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-11-20 03:43:23,375 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-11-20 03:43:23,375 INFO L440 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-11-20 03:43:23,375 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 628) the Hoare annotation is: false [2019-11-20 03:43:23,375 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-20 03:43:23,375 INFO L444 ceAbstractionStarter]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 03:43:23,375 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-11-20 03:43:23,375 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-11-20 03:43:23,375 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-11-20 03:43:23,375 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-11-20 03:43:23,376 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-11-20 03:43:23,376 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-20 03:43:23,376 INFO L444 ceAbstractionStarter]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 03:43:23,376 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-20 03:43:23,376 INFO L440 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-11-20 03:43:23,376 INFO L440 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-11-20 03:43:23,376 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-20 03:43:23,376 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-11-20 03:43:23,377 INFO L440 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-11-20 03:43:23,377 INFO L444 ceAbstractionStarter]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-11-20 03:43:23,377 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-11-20 03:43:23,377 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-11-20 03:43:23,377 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-11-20 03:43:23,377 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-20 03:43:23,377 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-20 03:43:23,377 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-20 03:43:23,377 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L444 ceAbstractionStarter]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-11-20 03:43:23,378 INFO L440 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-11-20 03:43:23,379 INFO L440 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-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-20 03:43:23,379 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 627) the Hoare annotation is: false [2019-11-20 03:43:23,379 INFO L447 ceAbstractionStarter]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-11-20 03:43:23,379 INFO L447 ceAbstractionStarter]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-11-20 03:43:23,379 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-11-20 03:43:23,380 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-20 03:43:23,381 INFO L440 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-11-20 03:43:23,381 INFO L440 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-11-20 03:43:23,381 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 03:43:23,381 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:43:23,381 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-11-20 03:43:23,381 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-11-20 03:43:23,381 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-20 03:43:23,382 INFO L444 ceAbstractionStarter]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 03:43:23,382 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-11-20 03:43:23,382 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-11-20 03:43:23,382 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-11-20 03:43:23,382 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-11-20 03:43:23,382 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-11-20 03:43:23,382 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 623) the Hoare annotation is: false [2019-11-20 03:43:23,382 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-20 03:43:23,383 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-20 03:43:23,383 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-11-20 03:43:23,383 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-11-20 03:43:23,383 INFO L444 ceAbstractionStarter]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-11-20 03:43:23,383 INFO L444 ceAbstractionStarter]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-11-20 03:43:23,383 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-11-20 03:43:23,383 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-11-20 03:43:23,383 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-11-20 03:43:23,384 INFO L440 ceAbstractionStarter]: At program point L553(lines 65 677) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-20 03:43:23,384 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-20 03:43:23,384 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:43:23,384 INFO L440 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-11-20 03:43:23,384 INFO L440 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-11-20 03:43:23,385 INFO L440 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-11-20 03:43:23,385 INFO L444 ceAbstractionStarter]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-11-20 03:43:23,385 INFO L444 ceAbstractionStarter]: For program point L258(line 258) no Hoare annotation was computed. [2019-11-20 03:43:23,385 INFO L444 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2019-11-20 03:43:23,385 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-11-20 03:43:23,386 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-11-20 03:43:23,386 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-11-20 03:43:23,386 INFO L447 ceAbstractionStarter]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-11-20 03:43:23,386 INFO L444 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-20 03:43:23,386 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-20 03:43:23,386 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:43:23,386 INFO L444 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2019-11-20 03:43:23,387 INFO L444 ceAbstractionStarter]: For program point L260-1(line 260) no Hoare annotation was computed. [2019-11-20 03:43:23,387 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-20 03:43:23,387 INFO L440 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-11-20 03:43:23,387 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-11-20 03:43:23,387 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-20 03:43:23,388 INFO L440 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-11-20 03:43:23,388 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-11-20 03:43:23,388 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-11-20 03:43:23,388 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-11-20 03:43:23,388 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-20 03:43:23,388 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-11-20 03:43:23,388 INFO L444 ceAbstractionStarter]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-11-20 03:43:23,389 INFO L440 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-11-20 03:43:23,389 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-11-20 03:43:23,389 INFO L440 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-11-20 03:43:23,389 INFO L440 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-11-20 03:43:23,390 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-11-20 03:43:23,390 INFO L444 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-20 03:43:23,390 INFO L447 ceAbstractionStarter]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-11-20 03:43:23,390 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-20 03:43:23,390 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-20 03:43:23,390 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-11-20 03:43:23,390 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-11-20 03:43:23,390 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-11-20 03:43:23,391 INFO L440 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-11-20 03:43:23,391 INFO L440 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-11-20 03:43:23,391 INFO L440 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-11-20 03:43:23,392 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 03:43:23,392 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-11-20 03:43:23,392 INFO L444 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-20 03:43:23,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:43:23 BoogieIcfgContainer [2019-11-20 03:43:23,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:43:23,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:43:23,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:43:23,426 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:43:23,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:43:05" (3/4) ... [2019-11-20 03:43:23,429 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:43:23,445 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 03:43:23,446 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:43:23,539 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_04f93125-7423-48a8-93c8-29531ffd729a/bin/uautomizer/witness.graphml [2019-11-20 03:43:23,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:43:23,541 INFO L168 Benchmark]: Toolchain (without parser) took 19001.57 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 444.6 MB). Free memory was 946.0 MB in the beginning and 990.5 MB in the end (delta: -44.5 MB). Peak memory consumption was 400.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:23,541 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:43:23,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -203.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:23,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:43:23,542 INFO L168 Benchmark]: Boogie Preprocessor took 34.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:23,542 INFO L168 Benchmark]: RCFGBuilder took 718.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:23,543 INFO L168 Benchmark]: TraceAbstraction took 17595.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 284.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.0 MB). Peak memory consumption was 506.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:23,543 INFO L168 Benchmark]: Witness Printer took 114.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 990.5 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:43:23,545 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.49 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 478.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -203.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 718.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17595.17 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 284.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.0 MB). Peak memory consumption was 506.9 MB. Max. memory is 11.5 GB. * Witness Printer took 114.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 990.5 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - PositiveResult [Line: 258]: 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: 17.5s, OverallIterations: 32, TraceHistogramMax: 14, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.4s, HoareTripleCheckerStatistics: 5368 SDtfs, 4720 SDslu, 2130 SDs, 0 SdLazy, 3171 SolverSat, 1069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s 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.2s HoareSimplificationTime, 29 FomulaSimplificationsInter, 93512 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s 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...