./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/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_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/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-6b5699a [2019-11-25 08:46:07,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:46:07,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:46:07,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:46:07,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:46:07,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:46:07,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:46:07,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:46:07,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:46:07,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:46:07,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:46:07,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:46:07,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:46:07,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:46:07,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:46:07,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:46:07,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:46:07,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:46:07,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:46:07,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:46:07,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:46:07,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:46:07,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:46:07,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:46:07,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:46:07,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:46:07,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:46:07,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:46:07,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:46:07,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:46:07,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:46:07,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:46:07,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:46:07,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:46:07,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:46:07,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:46:07,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:46:07,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:46:07,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:46:07,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:46:07,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:46:07,756 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-25 08:46:07,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:46:07,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:46:07,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:46:07,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:46:07,790 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:46:07,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:46:07,791 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:46:07,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:46:07,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:46:07,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:46:07,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:46:07,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:46:07,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:46:07,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:46:07,792 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-25 08:46:07,793 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:46:07,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:46:07,794 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:46:07,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:46:07,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:46:07,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:46:07,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:46:07,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:46:07,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:46:07,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:46:07,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:46:07,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:46:07,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:46:07,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:46:07,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:46:07,797 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_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/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-25 08:46:07,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:46:07,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:46:07,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:46:07,984 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:46:07,984 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:46:07,985 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-25 08:46:08,039 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/data/5972ffc25/c290f0e5badb4915bab8d52e9b1e2b71/FLAGd29188d42 [2019-11-25 08:46:08,464 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:46:08,465 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-25 08:46:08,476 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/data/5972ffc25/c290f0e5badb4915bab8d52e9b1e2b71/FLAGd29188d42 [2019-11-25 08:46:08,840 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/data/5972ffc25/c290f0e5badb4915bab8d52e9b1e2b71 [2019-11-25 08:46:08,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:46:08,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:46:08,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:08,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:46:08,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:46:08,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:08" (1/1) ... [2019-11-25 08:46:08,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dec846e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:08, skipping insertion in model container [2019-11-25 08:46:08,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:08" (1/1) ... [2019-11-25 08:46:08,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:46:08,924 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:46:09,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:09,261 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:46:09,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:09,326 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:46:09,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09 WrapperNode [2019-11-25 08:46:09,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:09,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:09,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:46:09,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:46:09,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... [2019-11-25 08:46:09,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... [2019-11-25 08:46:09,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:09,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:46:09,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:46:09,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:46:09,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... [2019-11-25 08:46:09,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... [2019-11-25 08:46:09,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... [2019-11-25 08:46:09,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... [2019-11-25 08:46:09,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... [2019-11-25 08:46:09,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... [2019-11-25 08:46:09,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... [2019-11-25 08:46:09,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:46:09,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:46:09,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:46:09,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:46:09,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/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-25 08:46:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:46:09,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:46:09,632 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:46:10,266 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-25 08:46:10,266 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-25 08:46:10,267 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:46:10,268 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:46:10,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:10 BoogieIcfgContainer [2019-11-25 08:46:10,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:46:10,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:46:10,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:46:10,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:46:10,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:46:08" (1/3) ... [2019-11-25 08:46:10,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b4d9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:10, skipping insertion in model container [2019-11-25 08:46:10,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:09" (2/3) ... [2019-11-25 08:46:10,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b4d9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:10, skipping insertion in model container [2019-11-25 08:46:10,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:10" (3/3) ... [2019-11-25 08:46:10,278 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-11-25 08:46:10,286 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:46:10,292 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-25 08:46:10,302 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-25 08:46:10,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:46:10,331 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:46:10,331 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:46:10,331 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:46:10,331 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:46:10,332 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:46:10,332 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:46:10,332 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:46:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-25 08:46:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:46:10,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:10,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:10,364 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:10,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:10,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1272360941, now seen corresponding path program 1 times [2019-11-25 08:46:10,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:10,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780620836] [2019-11-25 08:46:10,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:10,545 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-25 08:46:10,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780620836] [2019-11-25 08:46:10,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:10,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:10,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93559838] [2019-11-25 08:46:10,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:10,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:10,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:10,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:10,567 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-25 08:46:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:10,789 INFO L93 Difference]: Finished difference Result 311 states and 519 transitions. [2019-11-25 08:46:10,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:10,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-25 08:46:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:10,801 INFO L225 Difference]: With dead ends: 311 [2019-11-25 08:46:10,801 INFO L226 Difference]: Without dead ends: 149 [2019-11-25 08:46:10,804 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-25 08:46:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-25 08:46:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-25 08:46:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-25 08:46:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-11-25 08:46:10,850 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 17 [2019-11-25 08:46:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:10,850 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-11-25 08:46:10,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-11-25 08:46:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:46:10,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:10,851 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-25 08:46:10,852 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1039871977, now seen corresponding path program 1 times [2019-11-25 08:46:10,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:10,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466174120] [2019-11-25 08:46:10,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:10,901 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-25 08:46:10,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466174120] [2019-11-25 08:46:10,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:10,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:10,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066256908] [2019-11-25 08:46:10,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:10,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:10,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:10,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:10,904 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 3 states. [2019-11-25 08:46:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:11,071 INFO L93 Difference]: Finished difference Result 301 states and 450 transitions. [2019-11-25 08:46:11,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:11,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 08:46:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:11,075 INFO L225 Difference]: With dead ends: 301 [2019-11-25 08:46:11,075 INFO L226 Difference]: Without dead ends: 159 [2019-11-25 08:46:11,077 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-25 08:46:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-25 08:46:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2019-11-25 08:46:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-25 08:46:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2019-11-25 08:46:11,105 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2019-11-25 08:46:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:11,106 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2019-11-25 08:46:11,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2019-11-25 08:46:11,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:46:11,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:11,107 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-25 08:46:11,107 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:11,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1005531851, now seen corresponding path program 1 times [2019-11-25 08:46:11,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:11,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967510247] [2019-11-25 08:46:11,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:11,167 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-25 08:46:11,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967510247] [2019-11-25 08:46:11,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:11,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:11,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123147354] [2019-11-25 08:46:11,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:11,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:11,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:11,169 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand 3 states. [2019-11-25 08:46:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:11,322 INFO L93 Difference]: Finished difference Result 303 states and 452 transitions. [2019-11-25 08:46:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:11,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-25 08:46:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:11,325 INFO L225 Difference]: With dead ends: 303 [2019-11-25 08:46:11,325 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 08:46:11,326 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-25 08:46:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 08:46:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2019-11-25 08:46:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-25 08:46:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2019-11-25 08:46:11,357 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2019-11-25 08:46:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:11,358 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2019-11-25 08:46:11,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2019-11-25 08:46:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 08:46:11,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:11,360 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-25 08:46:11,360 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash -994026446, now seen corresponding path program 1 times [2019-11-25 08:46:11,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:11,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269091081] [2019-11-25 08:46:11,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:11,405 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-25 08:46:11,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269091081] [2019-11-25 08:46:11,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:11,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:11,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210224603] [2019-11-25 08:46:11,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:11,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:11,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:11,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:11,407 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand 3 states. [2019-11-25 08:46:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:11,555 INFO L93 Difference]: Finished difference Result 305 states and 454 transitions. [2019-11-25 08:46:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:11,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-25 08:46:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:11,557 INFO L225 Difference]: With dead ends: 305 [2019-11-25 08:46:11,557 INFO L226 Difference]: Without dead ends: 161 [2019-11-25 08:46:11,564 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-25 08:46:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-25 08:46:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2019-11-25 08:46:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 08:46:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2019-11-25 08:46:11,590 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2019-11-25 08:46:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:11,591 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2019-11-25 08:46:11,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2019-11-25 08:46:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:46:11,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:11,594 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-25 08:46:11,595 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash 461608262, now seen corresponding path program 1 times [2019-11-25 08:46:11,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:11,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267314884] [2019-11-25 08:46:11,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:11,648 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-25 08:46:11,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267314884] [2019-11-25 08:46:11,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:11,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:11,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088654177] [2019-11-25 08:46:11,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:11,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:11,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:11,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:11,650 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand 3 states. [2019-11-25 08:46:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:11,798 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2019-11-25 08:46:11,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:11,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-25 08:46:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:11,800 INFO L225 Difference]: With dead ends: 307 [2019-11-25 08:46:11,800 INFO L226 Difference]: Without dead ends: 162 [2019-11-25 08:46:11,801 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-25 08:46:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-25 08:46:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2019-11-25 08:46:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-25 08:46:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2019-11-25 08:46:11,824 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2019-11-25 08:46:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:11,825 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2019-11-25 08:46:11,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2019-11-25 08:46:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 08:46:11,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:11,830 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-25 08:46:11,831 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash 205704618, now seen corresponding path program 1 times [2019-11-25 08:46:11,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:11,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676866110] [2019-11-25 08:46:11,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:11,918 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-25 08:46:11,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676866110] [2019-11-25 08:46:11,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:11,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:11,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779145266] [2019-11-25 08:46:11,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:11,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:11,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:11,921 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand 3 states. [2019-11-25 08:46:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:12,098 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-25 08:46:12,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:12,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-25 08:46:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:12,099 INFO L225 Difference]: With dead ends: 330 [2019-11-25 08:46:12,100 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 08:46:12,100 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-25 08:46:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 08:46:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-25 08:46:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-25 08:46:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-11-25 08:46:12,141 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 46 [2019-11-25 08:46:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:12,142 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-11-25 08:46:12,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-11-25 08:46:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 08:46:12,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:12,145 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-25 08:46:12,145 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2094953876, now seen corresponding path program 1 times [2019-11-25 08:46:12,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:12,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338454773] [2019-11-25 08:46:12,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:12,200 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-25 08:46:12,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338454773] [2019-11-25 08:46:12,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:12,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:12,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66325162] [2019-11-25 08:46:12,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:12,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:12,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:12,207 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 3 states. [2019-11-25 08:46:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:12,330 INFO L93 Difference]: Finished difference Result 379 states and 574 transitions. [2019-11-25 08:46:12,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:12,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-25 08:46:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:12,333 INFO L225 Difference]: With dead ends: 379 [2019-11-25 08:46:12,333 INFO L226 Difference]: Without dead ends: 202 [2019-11-25 08:46:12,333 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-25 08:46:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-25 08:46:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-11-25 08:46:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-25 08:46:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2019-11-25 08:46:12,343 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 58 [2019-11-25 08:46:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:12,343 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2019-11-25 08:46:12,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:12,344 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2019-11-25 08:46:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:46:12,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:12,353 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-25 08:46:12,353 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:12,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:12,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2134557448, now seen corresponding path program 1 times [2019-11-25 08:46:12,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:12,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221215671] [2019-11-25 08:46:12,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:12,409 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-25 08:46:12,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221215671] [2019-11-25 08:46:12,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:12,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:12,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271120247] [2019-11-25 08:46:12,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:12,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:12,411 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2019-11-25 08:46:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:12,538 INFO L93 Difference]: Finished difference Result 396 states and 595 transitions. [2019-11-25 08:46:12,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:12,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-25 08:46:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:12,540 INFO L225 Difference]: With dead ends: 396 [2019-11-25 08:46:12,541 INFO L226 Difference]: Without dead ends: 203 [2019-11-25 08:46:12,541 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-25 08:46:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-25 08:46:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-11-25 08:46:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-25 08:46:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 301 transitions. [2019-11-25 08:46:12,550 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 301 transitions. Word has length 59 [2019-11-25 08:46:12,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:12,551 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 301 transitions. [2019-11-25 08:46:12,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 301 transitions. [2019-11-25 08:46:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 08:46:12,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:12,553 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-25 08:46:12,553 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1607957135, now seen corresponding path program 1 times [2019-11-25 08:46:12,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:12,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060481415] [2019-11-25 08:46:12,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:12,592 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-25 08:46:12,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060481415] [2019-11-25 08:46:12,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:12,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:12,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682969370] [2019-11-25 08:46:12,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:12,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:12,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:12,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:12,593 INFO L87 Difference]: Start difference. First operand 201 states and 301 transitions. Second operand 3 states. [2019-11-25 08:46:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:12,725 INFO L93 Difference]: Finished difference Result 439 states and 666 transitions. [2019-11-25 08:46:12,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:12,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-25 08:46:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:12,728 INFO L225 Difference]: With dead ends: 439 [2019-11-25 08:46:12,728 INFO L226 Difference]: Without dead ends: 245 [2019-11-25 08:46:12,729 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-25 08:46:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-25 08:46:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2019-11-25 08:46:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-25 08:46:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 372 transitions. [2019-11-25 08:46:12,738 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 372 transitions. Word has length 72 [2019-11-25 08:46:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:12,739 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 372 transitions. [2019-11-25 08:46:12,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 372 transitions. [2019-11-25 08:46:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 08:46:12,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:12,740 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-25 08:46:12,741 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:12,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:12,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1882884773, now seen corresponding path program 1 times [2019-11-25 08:46:12,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:12,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838323109] [2019-11-25 08:46:12,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:12,772 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-25 08:46:12,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838323109] [2019-11-25 08:46:12,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:12,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:12,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611305645] [2019-11-25 08:46:12,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:12,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:12,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:12,775 INFO L87 Difference]: Start difference. First operand 243 states and 372 transitions. Second operand 3 states. [2019-11-25 08:46:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:12,926 INFO L93 Difference]: Finished difference Result 513 states and 788 transitions. [2019-11-25 08:46:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:12,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-25 08:46:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:12,928 INFO L225 Difference]: With dead ends: 513 [2019-11-25 08:46:12,929 INFO L226 Difference]: Without dead ends: 277 [2019-11-25 08:46:12,929 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-25 08:46:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-25 08:46:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 270. [2019-11-25 08:46:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-25 08:46:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 412 transitions. [2019-11-25 08:46:12,943 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 412 transitions. Word has length 73 [2019-11-25 08:46:12,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:12,945 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 412 transitions. [2019-11-25 08:46:12,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 412 transitions. [2019-11-25 08:46:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 08:46:12,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:12,946 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-25 08:46:12,947 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:12,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash -369256571, now seen corresponding path program 1 times [2019-11-25 08:46:12,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:12,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287570464] [2019-11-25 08:46:12,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:12,997 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-25 08:46:12,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287570464] [2019-11-25 08:46:12,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:12,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:12,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365631253] [2019-11-25 08:46:12,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:12,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:12,999 INFO L87 Difference]: Start difference. First operand 270 states and 412 transitions. Second operand 3 states. [2019-11-25 08:46:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:13,159 INFO L93 Difference]: Finished difference Result 536 states and 817 transitions. [2019-11-25 08:46:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:13,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-25 08:46:13,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:13,161 INFO L225 Difference]: With dead ends: 536 [2019-11-25 08:46:13,161 INFO L226 Difference]: Without dead ends: 273 [2019-11-25 08:46:13,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-25 08:46:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-25 08:46:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-11-25 08:46:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-25 08:46:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-11-25 08:46:13,173 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 73 [2019-11-25 08:46:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:13,173 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-11-25 08:46:13,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-11-25 08:46:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-25 08:46:13,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,174 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-25 08:46:13,175 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:13,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,175 INFO L82 PathProgramCache]: Analyzing trace with hash -189803919, now seen corresponding path program 1 times [2019-11-25 08:46:13,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:13,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554946071] [2019-11-25 08:46:13,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:13,206 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-25 08:46:13,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554946071] [2019-11-25 08:46:13,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:13,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:13,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399949097] [2019-11-25 08:46:13,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:13,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,209 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 3 states. [2019-11-25 08:46:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:13,351 INFO L93 Difference]: Finished difference Result 542 states and 825 transitions. [2019-11-25 08:46:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:13,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-25 08:46:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:13,354 INFO L225 Difference]: With dead ends: 542 [2019-11-25 08:46:13,354 INFO L226 Difference]: Without dead ends: 278 [2019-11-25 08:46:13,355 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-25 08:46:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-25 08:46:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2019-11-25 08:46:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-25 08:46:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2019-11-25 08:46:13,366 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 74 [2019-11-25 08:46:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:13,366 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2019-11-25 08:46:13,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-11-25 08:46:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:46:13,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,368 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-25 08:46:13,368 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash 873313086, now seen corresponding path program 1 times [2019-11-25 08:46:13,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:13,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66538728] [2019-11-25 08:46:13,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:13,409 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-25 08:46:13,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66538728] [2019-11-25 08:46:13,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:13,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:13,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548811477] [2019-11-25 08:46:13,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:13,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:13,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:13,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,411 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 3 states. [2019-11-25 08:46:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:13,596 INFO L93 Difference]: Finished difference Result 582 states and 881 transitions. [2019-11-25 08:46:13,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:13,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-25 08:46:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:13,599 INFO L225 Difference]: With dead ends: 582 [2019-11-25 08:46:13,599 INFO L226 Difference]: Without dead ends: 318 [2019-11-25 08:46:13,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-25 08:46:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-25 08:46:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2019-11-25 08:46:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-25 08:46:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 478 transitions. [2019-11-25 08:46:13,611 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 478 transitions. Word has length 89 [2019-11-25 08:46:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:13,611 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 478 transitions. [2019-11-25 08:46:13,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 478 transitions. [2019-11-25 08:46:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-25 08:46:13,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,613 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-25 08:46:13,613 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:13,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1282770437, now seen corresponding path program 1 times [2019-11-25 08:46:13,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:13,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111559781] [2019-11-25 08:46:13,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:13,646 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-25 08:46:13,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111559781] [2019-11-25 08:46:13,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:13,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:13,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615903525] [2019-11-25 08:46:13,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:13,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:13,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:13,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,649 INFO L87 Difference]: Start difference. First operand 314 states and 478 transitions. Second operand 3 states. [2019-11-25 08:46:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:13,816 INFO L93 Difference]: Finished difference Result 637 states and 972 transitions. [2019-11-25 08:46:13,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:13,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-25 08:46:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:13,818 INFO L225 Difference]: With dead ends: 637 [2019-11-25 08:46:13,818 INFO L226 Difference]: Without dead ends: 328 [2019-11-25 08:46:13,819 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-25 08:46:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-25 08:46:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2019-11-25 08:46:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-25 08:46:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 497 transitions. [2019-11-25 08:46:13,832 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 497 transitions. Word has length 90 [2019-11-25 08:46:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:13,832 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 497 transitions. [2019-11-25 08:46:13,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 497 transitions. [2019-11-25 08:46:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:46:13,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,834 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-25 08:46:13,834 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:13,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,834 INFO L82 PathProgramCache]: Analyzing trace with hash 630357241, now seen corresponding path program 1 times [2019-11-25 08:46:13,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:13,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569176614] [2019-11-25 08:46:13,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:13,867 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-25 08:46:13,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569176614] [2019-11-25 08:46:13,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:13,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:13,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957483484] [2019-11-25 08:46:13,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:13,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:13,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,869 INFO L87 Difference]: Start difference. First operand 324 states and 497 transitions. Second operand 3 states. [2019-11-25 08:46:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,016 INFO L93 Difference]: Finished difference Result 678 states and 1042 transitions. [2019-11-25 08:46:14,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-25 08:46:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,018 INFO L225 Difference]: With dead ends: 678 [2019-11-25 08:46:14,018 INFO L226 Difference]: Without dead ends: 361 [2019-11-25 08:46:14,019 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-25 08:46:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-25 08:46:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-25 08:46:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-25 08:46:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 531 transitions. [2019-11-25 08:46:14,032 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 531 transitions. Word has length 99 [2019-11-25 08:46:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,033 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 531 transitions. [2019-11-25 08:46:14,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 531 transitions. [2019-11-25 08:46:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:46:14,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,034 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-25 08:46:14,035 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:14,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,035 INFO L82 PathProgramCache]: Analyzing trace with hash 757835045, now seen corresponding path program 1 times [2019-11-25 08:46:14,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197273228] [2019-11-25 08:46:14,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,062 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-25 08:46:14,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197273228] [2019-11-25 08:46:14,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950433601] [2019-11-25 08:46:14,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,064 INFO L87 Difference]: Start difference. First operand 349 states and 531 transitions. Second operand 3 states. [2019-11-25 08:46:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,200 INFO L93 Difference]: Finished difference Result 703 states and 1071 transitions. [2019-11-25 08:46:14,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-25 08:46:14,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,202 INFO L225 Difference]: With dead ends: 703 [2019-11-25 08:46:14,202 INFO L226 Difference]: Without dead ends: 361 [2019-11-25 08:46:14,203 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-25 08:46:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-25 08:46:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-25 08:46:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-25 08:46:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 526 transitions. [2019-11-25 08:46:14,217 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 526 transitions. Word has length 100 [2019-11-25 08:46:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,218 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 526 transitions. [2019-11-25 08:46:14,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 526 transitions. [2019-11-25 08:46:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-25 08:46:14,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,220 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-25 08:46:14,220 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,220 INFO L82 PathProgramCache]: Analyzing trace with hash -927735321, now seen corresponding path program 1 times [2019-11-25 08:46:14,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137546813] [2019-11-25 08:46:14,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,249 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-25 08:46:14,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137546813] [2019-11-25 08:46:14,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778403089] [2019-11-25 08:46:14,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,251 INFO L87 Difference]: Start difference. First operand 349 states and 526 transitions. Second operand 3 states. [2019-11-25 08:46:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,379 INFO L93 Difference]: Finished difference Result 718 states and 1081 transitions. [2019-11-25 08:46:14,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-25 08:46:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,381 INFO L225 Difference]: With dead ends: 718 [2019-11-25 08:46:14,381 INFO L226 Difference]: Without dead ends: 376 [2019-11-25 08:46:14,382 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-25 08:46:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-25 08:46:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-25 08:46:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-25 08:46:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 556 transitions. [2019-11-25 08:46:14,397 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 556 transitions. Word has length 119 [2019-11-25 08:46:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,397 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 556 transitions. [2019-11-25 08:46:14,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 556 transitions. [2019-11-25 08:46:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-25 08:46:14,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,399 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-25 08:46:14,400 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1207090035, now seen corresponding path program 1 times [2019-11-25 08:46:14,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328626892] [2019-11-25 08:46:14,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,429 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-25 08:46:14,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328626892] [2019-11-25 08:46:14,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141478060] [2019-11-25 08:46:14,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,431 INFO L87 Difference]: Start difference. First operand 373 states and 556 transitions. Second operand 3 states. [2019-11-25 08:46:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,596 INFO L93 Difference]: Finished difference Result 742 states and 1105 transitions. [2019-11-25 08:46:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-25 08:46:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,599 INFO L225 Difference]: With dead ends: 742 [2019-11-25 08:46:14,599 INFO L226 Difference]: Without dead ends: 376 [2019-11-25 08:46:14,600 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-25 08:46:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-25 08:46:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-25 08:46:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-25 08:46:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 550 transitions. [2019-11-25 08:46:14,617 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 550 transitions. Word has length 120 [2019-11-25 08:46:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,617 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 550 transitions. [2019-11-25 08:46:14,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 550 transitions. [2019-11-25 08:46:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-25 08:46:14,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,620 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-25 08:46:14,620 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,620 INFO L82 PathProgramCache]: Analyzing trace with hash -568364771, now seen corresponding path program 1 times [2019-11-25 08:46:14,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226370088] [2019-11-25 08:46:14,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,681 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-25 08:46:14,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226370088] [2019-11-25 08:46:14,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525364548] [2019-11-25 08:46:14,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,684 INFO L87 Difference]: Start difference. First operand 373 states and 550 transitions. Second operand 3 states. [2019-11-25 08:46:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,854 INFO L93 Difference]: Finished difference Result 784 states and 1155 transitions. [2019-11-25 08:46:14,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-25 08:46:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,857 INFO L225 Difference]: With dead ends: 784 [2019-11-25 08:46:14,857 INFO L226 Difference]: Without dead ends: 418 [2019-11-25 08:46:14,858 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-25 08:46:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-25 08:46:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2019-11-25 08:46:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-25 08:46:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 609 transitions. [2019-11-25 08:46:14,874 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 609 transitions. Word has length 129 [2019-11-25 08:46:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,875 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 609 transitions. [2019-11-25 08:46:14,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 609 transitions. [2019-11-25 08:46:14,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-25 08:46:14,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,877 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-25 08:46:14,877 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:14,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,878 INFO L82 PathProgramCache]: Analyzing trace with hash 12959108, now seen corresponding path program 1 times [2019-11-25 08:46:14,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150347286] [2019-11-25 08:46:14,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,923 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-25 08:46:14,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150347286] [2019-11-25 08:46:14,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220852100] [2019-11-25 08:46:14,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,925 INFO L87 Difference]: Start difference. First operand 414 states and 609 transitions. Second operand 3 states. [2019-11-25 08:46:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:15,089 INFO L93 Difference]: Finished difference Result 825 states and 1212 transitions. [2019-11-25 08:46:15,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:15,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-25 08:46:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:15,092 INFO L225 Difference]: With dead ends: 825 [2019-11-25 08:46:15,092 INFO L226 Difference]: Without dead ends: 416 [2019-11-25 08:46:15,093 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-25 08:46:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-25 08:46:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 412. [2019-11-25 08:46:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-25 08:46:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2019-11-25 08:46:15,109 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 130 [2019-11-25 08:46:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:15,109 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2019-11-25 08:46:15,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2019-11-25 08:46:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-25 08:46:15,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:15,111 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-25 08:46:15,112 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash -637521445, now seen corresponding path program 1 times [2019-11-25 08:46:15,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:15,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837841448] [2019-11-25 08:46:15,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,149 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-25 08:46:15,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837841448] [2019-11-25 08:46:15,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:15,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:15,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676809150] [2019-11-25 08:46:15,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:15,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:15,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:15,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:15,151 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand 3 states. [2019-11-25 08:46:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:15,288 INFO L93 Difference]: Finished difference Result 842 states and 1234 transitions. [2019-11-25 08:46:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:15,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-25 08:46:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:15,291 INFO L225 Difference]: With dead ends: 842 [2019-11-25 08:46:15,292 INFO L226 Difference]: Without dead ends: 437 [2019-11-25 08:46:15,292 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-25 08:46:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-25 08:46:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-25 08:46:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-25 08:46:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 627 transitions. [2019-11-25 08:46:15,309 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 627 transitions. Word has length 140 [2019-11-25 08:46:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:15,309 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 627 transitions. [2019-11-25 08:46:15,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 627 transitions. [2019-11-25 08:46:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-25 08:46:15,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:15,311 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-25 08:46:15,312 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:15,312 INFO L82 PathProgramCache]: Analyzing trace with hash 871119983, now seen corresponding path program 1 times [2019-11-25 08:46:15,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:15,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763973917] [2019-11-25 08:46:15,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,346 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-25 08:46:15,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763973917] [2019-11-25 08:46:15,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:15,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:15,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361898073] [2019-11-25 08:46:15,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:15,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:15,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:15,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:15,348 INFO L87 Difference]: Start difference. First operand 433 states and 627 transitions. Second operand 3 states. [2019-11-25 08:46:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:15,484 INFO L93 Difference]: Finished difference Result 863 states and 1249 transitions. [2019-11-25 08:46:15,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:15,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-25 08:46:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:15,487 INFO L225 Difference]: With dead ends: 863 [2019-11-25 08:46:15,487 INFO L226 Difference]: Without dead ends: 437 [2019-11-25 08:46:15,488 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-25 08:46:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-25 08:46:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-25 08:46:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-25 08:46:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-11-25 08:46:15,504 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 141 [2019-11-25 08:46:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:15,505 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-11-25 08:46:15,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-11-25 08:46:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-25 08:46:15,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:15,507 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-25 08:46:15,507 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1128117336, now seen corresponding path program 1 times [2019-11-25 08:46:15,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:15,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370448293] [2019-11-25 08:46:15,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,549 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-25 08:46:15,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370448293] [2019-11-25 08:46:15,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:15,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:15,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314657810] [2019-11-25 08:46:15,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:15,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:15,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:15,551 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-11-25 08:46:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:15,586 INFO L93 Difference]: Finished difference Result 1279 states and 1823 transitions. [2019-11-25 08:46:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:15,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-25 08:46:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:15,591 INFO L225 Difference]: With dead ends: 1279 [2019-11-25 08:46:15,592 INFO L226 Difference]: Without dead ends: 853 [2019-11-25 08:46:15,593 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-25 08:46:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-11-25 08:46:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 434. [2019-11-25 08:46:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-25 08:46:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2019-11-25 08:46:15,613 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 156 [2019-11-25 08:46:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:15,614 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2019-11-25 08:46:15,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2019-11-25 08:46:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-25 08:46:15,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:15,616 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-25 08:46:15,616 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash 386659640, now seen corresponding path program 1 times [2019-11-25 08:46:15,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:15,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963286704] [2019-11-25 08:46:15,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,692 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-25 08:46:15,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963286704] [2019-11-25 08:46:15,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303501488] [2019-11-25 08:46:15,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/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-25 08:46:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:15,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:15,842 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-25 08:46:15,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:15,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:46:15,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401469810] [2019-11-25 08:46:15,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:15,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:15,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:15,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:15,845 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand 4 states. [2019-11-25 08:46:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:16,198 INFO L93 Difference]: Finished difference Result 1355 states and 1932 transitions. [2019-11-25 08:46:16,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:46:16,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-25 08:46:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:16,204 INFO L225 Difference]: With dead ends: 1355 [2019-11-25 08:46:16,204 INFO L226 Difference]: Without dead ends: 903 [2019-11-25 08:46:16,205 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-25 08:46:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-25 08:46:16,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 532. [2019-11-25 08:46:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-25 08:46:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 761 transitions. [2019-11-25 08:46:16,233 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 761 transitions. Word has length 156 [2019-11-25 08:46:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:16,233 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 761 transitions. [2019-11-25 08:46:16,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 761 transitions. [2019-11-25 08:46:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-25 08:46:16,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:16,236 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-25 08:46:16,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:16,439 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1891443376, now seen corresponding path program 1 times [2019-11-25 08:46:16,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:16,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255224775] [2019-11-25 08:46:16,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:16,517 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-25 08:46:16,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255224775] [2019-11-25 08:46:16,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013535028] [2019-11-25 08:46:16,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/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-25 08:46:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:16,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:16,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:16,635 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-25 08:46:16,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:16,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:46:16,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256912590] [2019-11-25 08:46:16,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:16,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:16,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:16,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:16,638 INFO L87 Difference]: Start difference. First operand 532 states and 761 transitions. Second operand 4 states. [2019-11-25 08:46:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:16,962 INFO L93 Difference]: Finished difference Result 1476 states and 2098 transitions. [2019-11-25 08:46:16,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:46:16,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-25 08:46:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:16,967 INFO L225 Difference]: With dead ends: 1476 [2019-11-25 08:46:16,967 INFO L226 Difference]: Without dead ends: 951 [2019-11-25 08:46:16,969 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-25 08:46:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-11-25 08:46:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 587. [2019-11-25 08:46:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-25 08:46:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-11-25 08:46:16,998 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 158 [2019-11-25 08:46:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:16,998 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-11-25 08:46:16,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-11-25 08:46:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-25 08:46:17,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:17,002 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-25 08:46:17,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:17,206 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:17,206 INFO L82 PathProgramCache]: Analyzing trace with hash -136801648, now seen corresponding path program 1 times [2019-11-25 08:46:17,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:17,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117346879] [2019-11-25 08:46:17,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:17,285 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-25 08:46:17,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117346879] [2019-11-25 08:46:17,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826288534] [2019-11-25 08:46:17,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/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-25 08:46:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:17,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:17,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:17,411 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-25 08:46:17,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:17,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:46:17,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143060559] [2019-11-25 08:46:17,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:17,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:17,413 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 4 states. [2019-11-25 08:46:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:17,730 INFO L93 Difference]: Finished difference Result 1484 states and 2022 transitions. [2019-11-25 08:46:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:46:17,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-25 08:46:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:17,736 INFO L225 Difference]: With dead ends: 1484 [2019-11-25 08:46:17,736 INFO L226 Difference]: Without dead ends: 897 [2019-11-25 08:46:17,737 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-25 08:46:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-25 08:46:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 515. [2019-11-25 08:46:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-25 08:46:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2019-11-25 08:46:17,761 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 166 [2019-11-25 08:46:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:17,762 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2019-11-25 08:46:17,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2019-11-25 08:46:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-25 08:46:17,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:17,764 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-25 08:46:17,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:17,976 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:17,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:17,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1003230858, now seen corresponding path program 1 times [2019-11-25 08:46:17,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:17,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933475480] [2019-11-25 08:46:17,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,048 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-25 08:46:18,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933475480] [2019-11-25 08:46:18,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:18,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799747988] [2019-11-25 08:46:18,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,050 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand 3 states. [2019-11-25 08:46:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:18,090 INFO L93 Difference]: Finished difference Result 1226 states and 1656 transitions. [2019-11-25 08:46:18,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:18,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-25 08:46:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:18,093 INFO L225 Difference]: With dead ends: 1226 [2019-11-25 08:46:18,094 INFO L226 Difference]: Without dead ends: 477 [2019-11-25 08:46:18,095 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-25 08:46:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-25 08:46:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-11-25 08:46:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-11-25 08:46:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 648 transitions. [2019-11-25 08:46:18,115 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 648 transitions. Word has length 168 [2019-11-25 08:46:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:18,116 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 648 transitions. [2019-11-25 08:46:18,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 648 transitions. [2019-11-25 08:46:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-25 08:46:18,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:18,119 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-25 08:46:18,119 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1602987784, now seen corresponding path program 1 times [2019-11-25 08:46:18,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:18,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272985718] [2019-11-25 08:46:18,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,165 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-25 08:46:18,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272985718] [2019-11-25 08:46:18,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:18,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683900463] [2019-11-25 08:46:18,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,167 INFO L87 Difference]: Start difference. First operand 477 states and 648 transitions. Second operand 3 states. [2019-11-25 08:46:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:18,312 INFO L93 Difference]: Finished difference Result 964 states and 1304 transitions. [2019-11-25 08:46:18,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:18,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-25 08:46:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:18,316 INFO L225 Difference]: With dead ends: 964 [2019-11-25 08:46:18,316 INFO L226 Difference]: Without dead ends: 482 [2019-11-25 08:46:18,317 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-25 08:46:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-25 08:46:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2019-11-25 08:46:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-25 08:46:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2019-11-25 08:46:18,337 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 200 [2019-11-25 08:46:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:18,337 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2019-11-25 08:46:18,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2019-11-25 08:46:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-25 08:46:18,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:18,343 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-25 08:46:18,343 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:18,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1001955789, now seen corresponding path program 1 times [2019-11-25 08:46:18,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:18,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596778692] [2019-11-25 08:46:18,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,479 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-25 08:46:18,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596778692] [2019-11-25 08:46:18,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:18,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679768537] [2019-11-25 08:46:18,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,483 INFO L87 Difference]: Start difference. First operand 478 states and 639 transitions. Second operand 3 states. [2019-11-25 08:46:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:18,617 INFO L93 Difference]: Finished difference Result 985 states and 1310 transitions. [2019-11-25 08:46:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:18,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-11-25 08:46:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:18,621 INFO L225 Difference]: With dead ends: 985 [2019-11-25 08:46:18,621 INFO L226 Difference]: Without dead ends: 514 [2019-11-25 08:46:18,623 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-25 08:46:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-25 08:46:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-11-25 08:46:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-25 08:46:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 678 transitions. [2019-11-25 08:46:18,644 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 678 transitions. Word has length 339 [2019-11-25 08:46:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:18,645 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 678 transitions. [2019-11-25 08:46:18,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 678 transitions. [2019-11-25 08:46:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-25 08:46:18,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:18,651 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-25 08:46:18,652 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:18,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1590673358, now seen corresponding path program 1 times [2019-11-25 08:46:18,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:18,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086539148] [2019-11-25 08:46:18,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,775 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-25 08:46:18,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086539148] [2019-11-25 08:46:18,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:18,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536553311] [2019-11-25 08:46:18,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,778 INFO L87 Difference]: Start difference. First operand 512 states and 678 transitions. Second operand 3 states. [2019-11-25 08:46:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:18,916 INFO L93 Difference]: Finished difference Result 1055 states and 1392 transitions. [2019-11-25 08:46:18,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:18,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-11-25 08:46:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:18,919 INFO L225 Difference]: With dead ends: 1055 [2019-11-25 08:46:18,920 INFO L226 Difference]: Without dead ends: 550 [2019-11-25 08:46:18,921 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-25 08:46:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-25 08:46:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-11-25 08:46:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-25 08:46:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 719 transitions. [2019-11-25 08:46:18,947 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 719 transitions. Word has length 370 [2019-11-25 08:46:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:18,948 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 719 transitions. [2019-11-25 08:46:18,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 719 transitions. [2019-11-25 08:46:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-25 08:46:18,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:18,955 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-25 08:46:18,955 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash 458339096, now seen corresponding path program 1 times [2019-11-25 08:46:18,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:18,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958858601] [2019-11-25 08:46:18,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:19,203 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-25 08:46:19,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958858601] [2019-11-25 08:46:19,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:19,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:19,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363563857] [2019-11-25 08:46:19,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:19,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:19,205 INFO L87 Difference]: Start difference. First operand 548 states and 719 transitions. Second operand 3 states. [2019-11-25 08:46:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:19,259 INFO L93 Difference]: Finished difference Result 1630 states and 2135 transitions. [2019-11-25 08:46:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:19,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-11-25 08:46:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:19,266 INFO L225 Difference]: With dead ends: 1630 [2019-11-25 08:46:19,266 INFO L226 Difference]: Without dead ends: 1089 [2019-11-25 08:46:19,268 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-25 08:46:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-11-25 08:46:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2019-11-25 08:46:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-11-25 08:46:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1426 transitions. [2019-11-25 08:46:19,314 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1426 transitions. Word has length 403 [2019-11-25 08:46:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:19,315 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 1426 transitions. [2019-11-25 08:46:19,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1426 transitions. [2019-11-25 08:46:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-25 08:46:19,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:19,323 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-25 08:46:19,324 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:46:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash 747158486, now seen corresponding path program 1 times [2019-11-25 08:46:19,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:19,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636883555] [2019-11-25 08:46:19,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:19,476 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-25 08:46:19,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636883555] [2019-11-25 08:46:19,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594278701] [2019-11-25 08:46:19,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/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-25 08:46:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:19,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:19,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:19,732 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-25 08:46:19,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:19,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:46:19,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706138120] [2019-11-25 08:46:19,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:19,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:19,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:19,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:19,734 INFO L87 Difference]: Start difference. First operand 1087 states and 1426 transitions. Second operand 4 states. [2019-11-25 08:46:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:20,013 INFO L93 Difference]: Finished difference Result 2539 states and 3361 transitions. [2019-11-25 08:46:20,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:46:20,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-11-25 08:46:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:20,014 INFO L225 Difference]: With dead ends: 2539 [2019-11-25 08:46:20,014 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:46:20,017 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-25 08:46:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:46:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:46:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:46:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:46:20,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 403 [2019-11-25 08:46:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:20,018 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:46:20,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:46:20,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:46:20,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:20,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:46:21,055 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-25 08:46:21,517 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-25 08:46:21,900 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-25 08:46:22,405 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-11-25 08:46:22,704 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-25 08:46:22,940 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-25 08:46:23,180 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2019-11-25 08:46:23,428 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-25 08:46:23,665 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-25 08:46:23,933 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-25 08:46:24,144 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-25 08:46:24,375 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-25 08:46:24,556 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 14 [2019-11-25 08:46:24,731 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-25 08:46:24,908 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 14 [2019-11-25 08:46:25,182 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-11-25 08:46:26,375 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-25 08:46:26,506 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 6 [2019-11-25 08:46:26,652 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 48 [2019-11-25 08:46:27,770 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-25 08:46:27,899 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-25 08:46:27,902 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-25 08:46:27,902 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-11-25 08:46:27,902 INFO L444 ceAbstractionStarter]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-11-25 08:46:27,902 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-11-25 08:46:27,902 INFO L444 ceAbstractionStarter]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-11-25 08:46:27,902 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:46:27,902 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-11-25 08:46:27,903 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-11-25 08:46:27,903 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-11-25 08:46:27,903 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-11-25 08:46:27,903 INFO L444 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-25 08:46:27,903 INFO L444 ceAbstractionStarter]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-11-25 08:46:27,903 INFO L444 ceAbstractionStarter]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-11-25 08:46:27,903 INFO L444 ceAbstractionStarter]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-11-25 08:46:27,903 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-11-25 08:46:27,904 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-25 08:46:27,904 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 628) the Hoare annotation is: false [2019-11-25 08:46:27,904 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-25 08:46:27,904 INFO L444 ceAbstractionStarter]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:46:27,904 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-11-25 08:46:27,904 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-11-25 08:46:27,904 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-11-25 08:46:27,904 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-11-25 08:46:27,905 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-11-25 08:46:27,905 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-25 08:46:27,905 INFO L444 ceAbstractionStarter]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:46:27,905 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-25 08:46:27,905 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-25 08:46:27,905 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse13 (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 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13))) [2019-11-25 08:46:27,906 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-25 08:46:27,906 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-11-25 08:46:27,906 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-25 08:46:27,906 INFO L444 ceAbstractionStarter]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-11-25 08:46:27,906 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-11-25 08:46:27,906 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-11-25 08:46:27,906 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-11-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-25 08:46:27,907 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-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-11-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-11-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-11-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-11-25 08:46:27,907 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-11-25 08:46:27,908 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-11-25 08:46:27,908 INFO L444 ceAbstractionStarter]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-11-25 08:46:27,908 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-25 08:46:27,908 INFO L444 ceAbstractionStarter]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-11-25 08:46:27,908 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1))) [2019-11-25 08:46:27,908 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-25 08:46:27,908 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-25 08:46:27,908 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 627) the Hoare annotation is: false [2019-11-25 08:46:27,908 INFO L447 ceAbstractionStarter]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-11-25 08:46:27,908 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-11-25 08:46:27,908 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L447 ceAbstractionStarter]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-11-25 08:46:27,909 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-11-25 08:46:27,910 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-11-25 08:46:27,910 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-11-25 08:46:27,910 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-11-25 08:46:27,910 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-25 08:46:27,910 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-11-25 08:46:27,910 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-25 08:46:27,910 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1))) [2019-11-25 08:46:27,911 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-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-11-25 08:46:27,911 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-11-25 08:46:27,912 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 623) the Hoare annotation is: false [2019-11-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-11-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-11-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-11-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-11-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-11-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-11-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-11-25 08:46:27,912 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-25 08:46:27,912 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-25 08:46:27,913 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:46:27,913 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:46:27,913 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-25 08:46:27,913 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 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (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))))) [2019-11-25 08:46:27,913 INFO L444 ceAbstractionStarter]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-11-25 08:46:27,913 INFO L444 ceAbstractionStarter]: For program point L258(line 258) no Hoare annotation was computed. [2019-11-25 08:46:27,914 INFO L444 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2019-11-25 08:46:27,914 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-11-25 08:46:27,914 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-11-25 08:46:27,914 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-11-25 08:46:27,914 INFO L447 ceAbstractionStarter]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-11-25 08:46:27,914 INFO L444 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-25 08:46:27,914 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-25 08:46:27,915 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:46:27,915 INFO L444 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2019-11-25 08:46:27,915 INFO L444 ceAbstractionStarter]: For program point L260-1(line 260) no Hoare annotation was computed. [2019-11-25 08:46:27,915 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-25 08:46:27,915 INFO L440 ceAbstractionStarter]: At program point L591(lines 99 659) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.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))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.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))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse12 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1 .cse13))) [2019-11-25 08:46:27,916 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-11-25 08:46:27,916 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-25 08:46:27,916 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-25 08:46:27,916 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-11-25 08:46:27,917 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-11-25 08:46:27,917 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-11-25 08:46:27,917 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-25 08:46:27,917 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-11-25 08:46:27,917 INFO L444 ceAbstractionStarter]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-11-25 08:46:27,917 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-25 08:46:27,918 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-11-25 08:46:27,918 INFO L440 ceAbstractionStarter]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:46:27,918 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-25 08:46:27,918 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-11-25 08:46:27,918 INFO L444 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-25 08:46:27,918 INFO L447 ceAbstractionStarter]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-11-25 08:46:27,918 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-25 08:46:27,919 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-25 08:46:27,919 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-11-25 08:46:27,919 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-11-25 08:46:27,919 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-11-25 08:46:27,919 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 659) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.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))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.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))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.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 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse12 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1 .cse13))) [2019-11-25 08:46:27,919 INFO L440 ceAbstractionStarter]: At program point L166(lines 165 607) the Hoare annotation is: (let ((.cse9 (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 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 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.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))) (.cse16 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-25 08:46:27,920 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 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (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))))) [2019-11-25 08:46:27,920 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-25 08:46:27,920 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-11-25 08:46:27,920 INFO L444 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-25 08:46:27,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:46:27 BoogieIcfgContainer [2019-11-25 08:46:27,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:46:27,957 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:46:27,957 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:46:27,957 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:46:27,958 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:10" (3/4) ... [2019-11-25 08:46:27,961 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:46:27,978 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:46:27,979 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:46:28,089 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_859c59f3-99f3-4f1f-b2b5-af5c795c2b6c/bin/uautomizer/witness.graphml [2019-11-25 08:46:28,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:46:28,090 INFO L168 Benchmark]: Toolchain (without parser) took 19245.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 548.9 MB). Free memory was 944.7 MB in the beginning and 893.0 MB in the end (delta: 51.7 MB). Peak memory consumption was 600.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:28,091 INFO L168 Benchmark]: CDTParser took 0.20 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-25 08:46:28,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:28,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.49 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-25 08:46:28,092 INFO L168 Benchmark]: Boogie Preprocessor took 48.49 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-25 08:46:28,092 INFO L168 Benchmark]: RCFGBuilder took 835.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:28,092 INFO L168 Benchmark]: TraceAbstraction took 17686.93 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 408.9 MB). Free memory was 1.1 GB in the beginning and 911.6 MB in the end (delta: 156.6 MB). Peak memory consumption was 567.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:28,093 INFO L168 Benchmark]: Witness Printer took 132.21 ms. Allocated memory is still 1.6 GB. Free memory was 911.6 MB in the beginning and 893.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:28,094 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.20 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 479.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.49 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 48.49 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 835.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17686.93 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 408.9 MB). Free memory was 1.1 GB in the beginning and 911.6 MB in the end (delta: 156.6 MB). Peak memory consumption was 567.2 MB. Max. memory is 11.5 GB. * Witness Printer took 132.21 ms. Allocated memory is still 1.6 GB. Free memory was 911.6 MB in the beginning and 893.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 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 == 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)) || ((((((((((((((((!(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 == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - 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 == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0)) || (((((((((((((((((!(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 == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit)) - InvariantResult [Line: 123]: 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 == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((!(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 == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - 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 == 8673) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || ((((((((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(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: ((((((!(s__state == 8656) && !(s__state == 8657)) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) || ((((((!(s__state == 8656) && !(s__state == 8576)) && !(s__state == 8657)) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) - 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: ((8576 <= s__state && s__state <= 8640) && !(0 == s__hit)) || ((!(s__state == 8576) && 8576 <= s__state) && s__state <= 8640) - 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: ((8576 <= s__state && s__state <= 8640) && !(0 == s__hit)) || ((!(s__state == 8576) && 8576 <= s__state) && s__state <= 8640) - 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 == 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 == 8576)) && !(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 == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545)) && !(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 == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8673) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || ((((((!(s__state == 8673) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - 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.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.6s, HoareTripleCheckerStatistics: 5368 SDtfs, 4720 SDslu, 2130 SDs, 0 SdLazy, 3171 SolverSat, 1069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 964 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 1658 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 206 NumberOfFragments, 1796 HoareAnnotationTreeSize, 29 FomulaSimplifications, 249232 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 29 FomulaSimplificationsInter, 93537 FormulaSimplificationTreeSizeReductionInter, 6.3s 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...