./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/busybox-1.22.0/hostid.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/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 64bit --witnessprinter.graph.data.programhash 8604245f5a4dee50703be8e530b281b92acb588c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 06:27:53,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:27:53,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:27:53,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:27:53,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:27:53,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:27:53,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:27:53,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:27:53,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:27:53,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:27:53,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:27:53,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:27:53,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:27:53,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:27:53,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:27:53,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:27:53,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:27:53,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:27:53,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:27:53,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:27:53,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:27:53,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:27:53,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:27:53,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:27:53,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:27:53,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:27:53,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:27:53,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:27:53,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:27:53,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:27:53,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:27:53,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:27:53,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:27:53,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:27:53,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:27:53,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:27:53,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:27:53,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:27:53,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:27:53,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:27:53,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:27:53,329 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-20 06:27:53,352 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:27:53,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:27:53,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:27:53,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:27:53,364 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:27:53,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:27:53,364 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 06:27:53,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:27:53,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:27:53,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:27:53,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:27:53,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:27:53,365 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-20 06:27:53,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:27:53,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:27:53,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:27:53,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:27:53,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:27:53,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:27:53,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:27:53,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:27:53,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:27:53,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:27:53,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:27:53,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 06:27:53,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 06:27:53,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:27:53,369 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_f6951443-0b86-42c4-b0a8-bdd64d694026/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8604245f5a4dee50703be8e530b281b92acb588c [2019-11-20 06:27:53,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:27:53,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:27:53,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:27:53,551 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:27:53,552 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:27:53,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/../../sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-11-20 06:27:53,614 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/data/1a9acb482/f9af801fe9b94fc9903e84bb18cc5a76/FLAG2c890301d [2019-11-20 06:27:54,184 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:27:54,185 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-11-20 06:27:54,215 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/data/1a9acb482/f9af801fe9b94fc9903e84bb18cc5a76/FLAG2c890301d [2019-11-20 06:27:54,413 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/data/1a9acb482/f9af801fe9b94fc9903e84bb18cc5a76 [2019-11-20 06:27:54,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:27:54,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:27:54,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:27:54,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:27:54,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:27:54,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:27:54" (1/1) ... [2019-11-20 06:27:54,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a9c70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:54, skipping insertion in model container [2019-11-20 06:27:54,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:27:54" (1/1) ... [2019-11-20 06:27:54,432 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:27:54,484 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:27:55,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:27:55,281 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:27:55,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:27:55,710 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:27:55,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55 WrapperNode [2019-11-20 06:27:55,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:27:55,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:27:55,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:27:55,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:27:55,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... [2019-11-20 06:27:55,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... [2019-11-20 06:27:55,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:27:55,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:27:55,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:27:55,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:27:55,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... [2019-11-20 06:27:55,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... [2019-11-20 06:27:55,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... [2019-11-20 06:27:55,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... [2019-11-20 06:27:55,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... [2019-11-20 06:27:55,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... [2019-11-20 06:27:55,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... [2019-11-20 06:27:55,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:27:55,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:27:55,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:27:55,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:27:55,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:27:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 06:27:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 06:27:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-11-20 06:27:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 06:27:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:27:55,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:27:55,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 06:27:55,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 06:27:55,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 06:27:55,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 06:27:56,789 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:27:56,790 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-20 06:27:56,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:27:56 BoogieIcfgContainer [2019-11-20 06:27:56,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:27:56,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:27:56,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:27:56,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:27:56,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:27:54" (1/3) ... [2019-11-20 06:27:56,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a72bbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:27:56, skipping insertion in model container [2019-11-20 06:27:56,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:27:55" (2/3) ... [2019-11-20 06:27:56,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a72bbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:27:56, skipping insertion in model container [2019-11-20 06:27:56,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:27:56" (3/3) ... [2019-11-20 06:27:56,802 INFO L109 eAbstractionObserver]: Analyzing ICFG hostid.i [2019-11-20 06:27:56,812 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:27:56,819 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-20 06:27:56,832 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-20 06:27:56,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:27:56,861 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:27:56,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:27:56,862 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:27:56,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:27:56,862 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:27:56,862 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:27:56,862 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:27:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-11-20 06:27:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-20 06:27:56,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:56,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-20 06:27:56,889 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-20 06:27:56,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:56,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993437155] [2019-11-20 06:27:56,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:27:57,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993437155] [2019-11-20 06:27:57,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:57,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:57,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110022609] [2019-11-20 06:27:57,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:57,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:57,277 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-11-20 06:27:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:57,329 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2019-11-20 06:27:57,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:57,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-20 06:27:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:57,341 INFO L225 Difference]: With dead ends: 92 [2019-11-20 06:27:57,341 INFO L226 Difference]: Without dead ends: 45 [2019-11-20 06:27:57,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-20 06:27:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-20 06:27:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 06:27:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-20 06:27:57,398 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2019-11-20 06:27:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:57,398 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-20 06:27:57,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-20 06:27:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 06:27:57,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:57,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 06:27:57,400 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:57,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:57,400 INFO L82 PathProgramCache]: Analyzing trace with hash 28698760, now seen corresponding path program 1 times [2019-11-20 06:27:57,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:57,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768019166] [2019-11-20 06:27:57,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:27:57,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768019166] [2019-11-20 06:27:57,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:57,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:57,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568337631] [2019-11-20 06:27:57,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:57,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:57,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:57,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:57,546 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-11-20 06:27:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:57,572 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-11-20 06:27:57,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:57,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-20 06:27:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:57,574 INFO L225 Difference]: With dead ends: 48 [2019-11-20 06:27:57,574 INFO L226 Difference]: Without dead ends: 47 [2019-11-20 06:27:57,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-20 06:27:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-20 06:27:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 06:27:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-20 06:27:57,582 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 5 [2019-11-20 06:27:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:57,582 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-20 06:27:57,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-20 06:27:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 06:27:57,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:57,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:57,584 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:57,584 INFO L82 PathProgramCache]: Analyzing trace with hash 266305344, now seen corresponding path program 1 times [2019-11-20 06:27:57,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:57,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415197850] [2019-11-20 06:27:57,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:27:57,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415197850] [2019-11-20 06:27:57,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:57,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:57,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602272507] [2019-11-20 06:27:57,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:57,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:57,699 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 3 states. [2019-11-20 06:27:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:57,783 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-11-20 06:27:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:57,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-20 06:27:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:57,785 INFO L225 Difference]: With dead ends: 47 [2019-11-20 06:27:57,785 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 06:27:57,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 06:27:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-20 06:27:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 06:27:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-20 06:27:57,794 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2019-11-20 06:27:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:57,794 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-20 06:27:57,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-20 06:27:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 06:27:57,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:57,796 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-11-20 06:27:57,797 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:57,797 INFO L82 PathProgramCache]: Analyzing trace with hash 266307074, now seen corresponding path program 1 times [2019-11-20 06:27:57,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:57,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520983924] [2019-11-20 06:27:57,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:27:57,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520983924] [2019-11-20 06:27:57,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:57,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:57,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234975153] [2019-11-20 06:27:57,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:57,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:57,881 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2019-11-20 06:27:57,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:57,904 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-20 06:27:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:57,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-20 06:27:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:57,907 INFO L225 Difference]: With dead ends: 43 [2019-11-20 06:27:57,907 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 06:27:57,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 06:27:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-20 06:27:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 06:27:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-20 06:27:57,920 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2019-11-20 06:27:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:57,920 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-20 06:27:57,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-20 06:27:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 06:27:57,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:57,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:57,921 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash -334468875, now seen corresponding path program 1 times [2019-11-20 06:27:57,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:57,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253591067] [2019-11-20 06:27:57,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:27:58,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253591067] [2019-11-20 06:27:58,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:58,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:58,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105315526] [2019-11-20 06:27:58,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:58,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,002 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2019-11-20 06:27:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:58,059 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-20 06:27:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:58,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-20 06:27:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:58,061 INFO L225 Difference]: With dead ends: 40 [2019-11-20 06:27:58,061 INFO L226 Difference]: Without dead ends: 38 [2019-11-20 06:27:58,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-20 06:27:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-20 06:27:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 06:27:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-20 06:27:58,066 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2019-11-20 06:27:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:58,066 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-20 06:27:58,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-20 06:27:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 06:27:58,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:58,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:58,067 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash 697960087, now seen corresponding path program 1 times [2019-11-20 06:27:58,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:58,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237489111] [2019-11-20 06:27:58,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:27:58,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237489111] [2019-11-20 06:27:58,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:58,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:58,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763507484] [2019-11-20 06:27:58,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:58,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:58,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:58,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,134 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-11-20 06:27:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:58,183 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-20 06:27:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:58,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 06:27:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:58,184 INFO L225 Difference]: With dead ends: 38 [2019-11-20 06:27:58,184 INFO L226 Difference]: Without dead ends: 36 [2019-11-20 06:27:58,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-20 06:27:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-20 06:27:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 06:27:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-20 06:27:58,189 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 11 [2019-11-20 06:27:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:58,189 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-20 06:27:58,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-20 06:27:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 06:27:58,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:58,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:58,191 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:58,191 INFO L82 PathProgramCache]: Analyzing trace with hash -557684678, now seen corresponding path program 1 times [2019-11-20 06:27:58,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:58,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466585349] [2019-11-20 06:27:58,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:27:58,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466585349] [2019-11-20 06:27:58,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:58,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:27:58,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051302481] [2019-11-20 06:27:58,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:58,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,255 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-11-20 06:27:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:58,294 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-11-20 06:27:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:58,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 06:27:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:58,295 INFO L225 Difference]: With dead ends: 60 [2019-11-20 06:27:58,296 INFO L226 Difference]: Without dead ends: 39 [2019-11-20 06:27:58,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-20 06:27:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-20 06:27:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 06:27:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-20 06:27:58,301 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-11-20 06:27:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:58,301 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-20 06:27:58,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-20 06:27:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 06:27:58,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:58,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:58,302 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:58,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017679, now seen corresponding path program 1 times [2019-11-20 06:27:58,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:58,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657108461] [2019-11-20 06:27:58,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 06:27:58,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657108461] [2019-11-20 06:27:58,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:58,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:27:58,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978332034] [2019-11-20 06:27:58,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:27:58,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:58,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:27:58,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:27:58,402 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2019-11-20 06:27:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:58,501 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-20 06:27:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:27:58,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-20 06:27:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:58,502 INFO L225 Difference]: With dead ends: 51 [2019-11-20 06:27:58,502 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 06:27:58,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:27:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 06:27:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-11-20 06:27:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 06:27:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-20 06:27:58,511 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-11-20 06:27:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:58,511 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-20 06:27:58,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:27:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-20 06:27:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 06:27:58,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:58,513 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:58,513 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:58,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017624, now seen corresponding path program 1 times [2019-11-20 06:27:58,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:58,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563000765] [2019-11-20 06:27:58,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 06:27:58,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563000765] [2019-11-20 06:27:58,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:58,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:58,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757836577] [2019-11-20 06:27:58,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:58,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:58,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:58,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,595 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-11-20 06:27:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:58,617 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-20 06:27:58,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:58,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 06:27:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:58,618 INFO L225 Difference]: With dead ends: 38 [2019-11-20 06:27:58,618 INFO L226 Difference]: Without dead ends: 37 [2019-11-20 06:27:58,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-20 06:27:58,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-20 06:27:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-20 06:27:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-20 06:27:58,622 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2019-11-20 06:27:58,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:58,623 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-20 06:27:58,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-20 06:27:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 06:27:58,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:58,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:58,624 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1840190412, now seen corresponding path program 1 times [2019-11-20 06:27:58,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:58,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336279287] [2019-11-20 06:27:58,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 06:27:58,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336279287] [2019-11-20 06:27:58,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:58,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:58,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184943862] [2019-11-20 06:27:58,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:58,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:58,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,716 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2019-11-20 06:27:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:58,776 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-11-20 06:27:58,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:58,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 06:27:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:58,778 INFO L225 Difference]: With dead ends: 59 [2019-11-20 06:27:58,778 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 06:27:58,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 06:27:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-11-20 06:27:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 06:27:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-20 06:27:58,783 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2019-11-20 06:27:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:58,783 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-20 06:27:58,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-20 06:27:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 06:27:58,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:58,784 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] [2019-11-20 06:27:58,784 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1840192110, now seen corresponding path program 1 times [2019-11-20 06:27:58,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:58,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713231164] [2019-11-20 06:27:58,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:27:58,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713231164] [2019-11-20 06:27:58,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:58,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:58,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412981300] [2019-11-20 06:27:58,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:58,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:58,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,857 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 3 states. [2019-11-20 06:27:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:58,883 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-20 06:27:58,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:58,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 06:27:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:58,885 INFO L225 Difference]: With dead ends: 57 [2019-11-20 06:27:58,886 INFO L226 Difference]: Without dead ends: 56 [2019-11-20 06:27:58,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-20 06:27:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-11-20 06:27:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-20 06:27:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-11-20 06:27:58,890 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 22 [2019-11-20 06:27:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:58,890 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-11-20 06:27:58,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-11-20 06:27:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 06:27:58,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:58,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:58,895 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2077877290, now seen corresponding path program 1 times [2019-11-20 06:27:58,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:58,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530420034] [2019-11-20 06:27:58,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:27:58,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530420034] [2019-11-20 06:27:58,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:58,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:27:58,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556593669] [2019-11-20 06:27:58,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:27:58,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:58,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:27:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:27:58,992 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-11-20 06:27:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:59,103 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-11-20 06:27:59,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:27:59,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 06:27:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:59,105 INFO L225 Difference]: With dead ends: 42 [2019-11-20 06:27:59,105 INFO L226 Difference]: Without dead ends: 41 [2019-11-20 06:27:59,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:27:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-20 06:27:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-20 06:27:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 06:27:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-11-20 06:27:59,110 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2019-11-20 06:27:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:59,110 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-20 06:27:59,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:27:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-11-20 06:27:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 06:27:59,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:59,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:59,112 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:59,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash 10313574, now seen corresponding path program 1 times [2019-11-20 06:27:59,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:59,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795104488] [2019-11-20 06:27:59,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:27:59,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795104488] [2019-11-20 06:27:59,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:59,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:59,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109278142] [2019-11-20 06:27:59,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:59,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:59,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:59,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:59,165 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2019-11-20 06:27:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:59,195 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-11-20 06:27:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:59,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 06:27:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:59,196 INFO L225 Difference]: With dead ends: 44 [2019-11-20 06:27:59,196 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 06:27:59,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 06:27:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-20 06:27:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 06:27:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-11-20 06:27:59,201 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-11-20 06:27:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:59,202 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-11-20 06:27:59,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-11-20 06:27:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 06:27:59,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:59,203 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] [2019-11-20 06:27:59,203 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:59,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:59,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1985844013, now seen corresponding path program 1 times [2019-11-20 06:27:59,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:59,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048244268] [2019-11-20 06:27:59,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:27:59,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048244268] [2019-11-20 06:27:59,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:59,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:59,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084136954] [2019-11-20 06:27:59,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:59,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:59,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:59,258 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2019-11-20 06:27:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:59,273 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-11-20 06:27:59,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:59,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 06:27:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:59,274 INFO L225 Difference]: With dead ends: 43 [2019-11-20 06:27:59,274 INFO L226 Difference]: Without dead ends: 30 [2019-11-20 06:27:59,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-20 06:27:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-20 06:27:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 06:27:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-20 06:27:59,277 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 28 [2019-11-20 06:27:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:59,277 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-20 06:27:59,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-20 06:27:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 06:27:59,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:27:59,278 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:27:59,279 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 06:27:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:27:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1042497349, now seen corresponding path program 1 times [2019-11-20 06:27:59,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:27:59,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282916518] [2019-11-20 06:27:59,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:27:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:27:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 06:27:59,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282916518] [2019-11-20 06:27:59,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:27:59,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:27:59,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227444514] [2019-11-20 06:27:59,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:27:59,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:27:59,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:27:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:59,341 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2019-11-20 06:27:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:27:59,364 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-11-20 06:27:59,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:27:59,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-20 06:27:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:27:59,365 INFO L225 Difference]: With dead ends: 30 [2019-11-20 06:27:59,365 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 06:27:59,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:27:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 06:27:59,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 06:27:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 06:27:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 06:27:59,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-20 06:27:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:27:59,366 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 06:27:59,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:27:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 06:27:59,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 06:27:59,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 06:27:59,783 INFO L440 ceAbstractionStarter]: At program point L1761(lines 1757 1762) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-20 06:27:59,783 INFO L447 ceAbstractionStarter]: At program point L1889(lines 1861 1890) the Hoare annotation is: true [2019-11-20 06:27:59,783 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L444 ceAbstractionStarter]: For program point L1873(line 1873) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L444 ceAbstractionStarter]: For program point L1873-1(line 1873) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L444 ceAbstractionStarter]: For program point L1873-2(line 1873) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L444 ceAbstractionStarter]: For program point L1873-3(line 1873) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L444 ceAbstractionStarter]: For program point L1865-2(lines 1865 1866) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L444 ceAbstractionStarter]: For program point L1865-3(line 1865) no Hoare annotation was computed. [2019-11-20 06:27:59,784 INFO L440 ceAbstractionStarter]: At program point L1865-4(lines 1865 1866) the Hoare annotation is: (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)) [2019-11-20 06:27:59,785 INFO L444 ceAbstractionStarter]: For program point L1865-5(lines 1865 1866) no Hoare annotation was computed. [2019-11-20 06:27:59,785 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 06:27:59,785 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-11-20 06:27:59,785 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 06:27:59,785 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-20 06:27:59,785 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 06:27:59,785 INFO L440 ceAbstractionStarter]: At program point L1779(lines 1777 1780) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-20 06:27:59,785 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-11-20 06:27:59,785 INFO L440 ceAbstractionStarter]: At program point L1775(lines 1766 1776) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-20 06:27:59,786 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-20 06:27:59,786 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-11-20 06:27:59,786 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 06:27:59,786 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-20 06:27:59,786 INFO L444 ceAbstractionStarter]: For program point L1875-2(lines 1875 1882) no Hoare annotation was computed. [2019-11-20 06:27:59,786 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-11-20 06:27:59,786 INFO L444 ceAbstractionStarter]: For program point L1875-3(line 1875) no Hoare annotation was computed. [2019-11-20 06:27:59,786 INFO L440 ceAbstractionStarter]: At program point L1875-4(lines 1875 1882) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~argc~0)) (.cse1 (<= ULTIMATE.start_main_~argc~0 10000)) (.cse2 (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~i~4 0)) (and (<= 0 (+ ULTIMATE.start_main_~j~0 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~4 2147483648)) .cse0 .cse1 .cse2))) [2019-11-20 06:27:59,786 INFO L444 ceAbstractionStarter]: For program point L1875-5(lines 1875 1882) no Hoare annotation was computed. [2019-11-20 06:27:59,786 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-20 06:27:59,787 INFO L444 ceAbstractionStarter]: For program point L1768(lines 1768 1769) no Hoare annotation was computed. [2019-11-20 06:27:59,787 INFO L444 ceAbstractionStarter]: For program point L1768-1(lines 1768 1769) no Hoare annotation was computed. [2019-11-20 06:27:59,787 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-20 06:27:59,787 INFO L444 ceAbstractionStarter]: For program point L1884-2(lines 1884 1885) no Hoare annotation was computed. [2019-11-20 06:27:59,787 INFO L444 ceAbstractionStarter]: For program point L1884-3(line 1884) no Hoare annotation was computed. [2019-11-20 06:27:59,787 INFO L440 ceAbstractionStarter]: At program point L1884-4(lines 1884 1885) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~5 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-20 06:27:59,787 INFO L444 ceAbstractionStarter]: For program point L1884-5(lines 1884 1885) no Hoare annotation was computed. [2019-11-20 06:27:59,787 INFO L444 ceAbstractionStarter]: For program point L1880-2(lines 1880 1881) no Hoare annotation was computed. [2019-11-20 06:27:59,787 INFO L444 ceAbstractionStarter]: For program point L1880-3(line 1880) no Hoare annotation was computed. [2019-11-20 06:27:59,788 INFO L440 ceAbstractionStarter]: At program point L1880-4(lines 1880 1881) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~4 9999) (<= 0 (+ ULTIMATE.start_main_~j~0 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~4 2147483648)) (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-20 06:27:59,788 INFO L444 ceAbstractionStarter]: For program point L1872(line 1872) no Hoare annotation was computed. [2019-11-20 06:27:59,788 INFO L444 ceAbstractionStarter]: For program point L1872-1(line 1872) no Hoare annotation was computed. [2019-11-20 06:27:59,788 INFO L444 ceAbstractionStarter]: For program point L1872-2(line 1872) no Hoare annotation was computed. [2019-11-20 06:27:59,788 INFO L444 ceAbstractionStarter]: For program point L1872-3(line 1872) no Hoare annotation was computed. [2019-11-20 06:27:59,788 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-11-20 06:27:59,788 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-11-20 06:27:59,788 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-20 06:27:59,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:27:59 BoogieIcfgContainer [2019-11-20 06:27:59,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:27:59,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:27:59,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:27:59,806 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:27:59,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:27:56" (3/4) ... [2019-11-20 06:27:59,810 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 06:27:59,821 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-20 06:27:59,822 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-20 06:27:59,822 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 06:27:59,877 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f6951443-0b86-42c4-b0a8-bdd64d694026/bin/uautomizer/witness.graphml [2019-11-20 06:27:59,877 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:27:59,879 INFO L168 Benchmark]: Toolchain (without parser) took 5461.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:27:59,879 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:27:59,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1293.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 946.1 MB in the beginning and 956.4 MB in the end (delta: -10.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:27:59,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.41 ms. Allocated memory is still 1.1 GB. Free memory was 956.4 MB in the beginning and 951.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 06:27:59,880 INFO L168 Benchmark]: Boogie Preprocessor took 84.97 ms. Allocated memory is still 1.1 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:27:59,881 INFO L168 Benchmark]: RCFGBuilder took 890.10 ms. Allocated memory is still 1.1 GB. Free memory was 951.0 MB in the beginning and 907.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-20 06:27:59,881 INFO L168 Benchmark]: TraceAbstraction took 3013.39 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 907.1 MB in the beginning and 1.2 GB in the end (delta: -243.2 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. [2019-11-20 06:27:59,882 INFO L168 Benchmark]: Witness Printer took 71.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-20 06:27:59,884 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.42 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1293.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 946.1 MB in the beginning and 956.4 MB in the end (delta: -10.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.41 ms. Allocated memory is still 1.1 GB. Free memory was 956.4 MB in the beginning and 951.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.97 ms. Allocated memory is still 1.1 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 890.10 ms. Allocated memory is still 1.1 GB. Free memory was 951.0 MB in the beginning and 907.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3013.39 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 907.1 MB in the beginning and 1.2 GB in the end (delta: -243.2 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. * Witness Printer took 71.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 1777]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1880]: Loop Invariant Derived loop invariant: ((((i <= 9999 && 0 <= j + 2147483648) && 0 <= i + 2147483648) && argc <= 10000) && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1884]: Loop Invariant Derived loop invariant: ((argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648) && 0 <= i + 2147483648 - InvariantResult [Line: 1757]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1861]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1766]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: (((1 <= argc && argc <= 10000) && 0 <= i + 2147483648) && i == 0) || ((((0 <= j + 2147483648 && 0 <= i + 2147483648) && 1 <= argc) && argc <= 10000) && 0 <= i + 2147483648) - InvariantResult [Line: 1865]: Loop Invariant Derived loop invariant: 0 <= i + 2147483648 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 16 error locations. Result: SAFE, OverallTime: 2.9s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 484 SDtfs, 241 SDslu, 337 SDs, 0 SdLazy, 172 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 21 NumberOfFragments, 123 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1073 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 166 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 8362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 36/36 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...