./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 758587bcbf021ce28de3aa106c09f74804dbda1d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:43:47,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:43:47,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:43:47,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:43:47,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:43:47,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:43:47,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:43:47,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:43:47,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:43:47,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:43:47,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:43:47,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:43:47,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:43:47,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:43:47,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:43:47,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:43:47,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:43:47,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:43:47,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:43:47,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:43:47,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:43:47,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:43:47,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:43:47,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:43:47,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:43:47,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:43:47,135 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:43:47,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:43:47,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:43:47,137 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:43:47,137 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:43:47,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:43:47,138 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:43:47,138 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:43:47,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:43:47,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:43:47,139 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-11-28 11:43:47,149 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:43:47,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:43:47,150 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:43:47,150 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:43:47,150 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:43:47,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:43:47,151 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:43:47,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:43:47,151 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:43:47,151 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:43:47,151 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:43:47,151 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:43:47,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:43:47,152 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:43:47,152 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:43:47,152 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:43:47,152 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 11:43:47,152 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:43:47,152 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:43:47,152 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:43:47,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:43:47,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:43:47,153 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:43:47,153 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:43:47,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:43:47,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:43:47,153 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:43:47,153 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:43:47,154 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:43:47,154 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:43:47,154 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:43:47,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:43:47,154 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 758587bcbf021ce28de3aa106c09f74804dbda1d [2018-11-28 11:43:47,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:43:47,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:43:47,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:43:47,186 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:43:47,186 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:43:47,187 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i [2018-11-28 11:43:47,224 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/data/b054333ac/357b3fa578aa4e69bfcde938d4355741/FLAG3d1807106 [2018-11-28 11:43:47,636 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:43:47,637 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/sv-benchmarks/c/bitvector/byte_add_2_false-no-overflow.i [2018-11-28 11:43:47,641 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/data/b054333ac/357b3fa578aa4e69bfcde938d4355741/FLAG3d1807106 [2018-11-28 11:43:47,650 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/data/b054333ac/357b3fa578aa4e69bfcde938d4355741 [2018-11-28 11:43:47,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:43:47,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:43:47,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:43:47,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:43:47,655 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:43:47,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bce3877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47, skipping insertion in model container [2018-11-28 11:43:47,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:43:47,673 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:43:47,781 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:43:47,783 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:43:47,805 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:43:47,813 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:43:47,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47 WrapperNode [2018-11-28 11:43:47,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:43:47,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:43:47,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:43:47,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:43:47,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:43:47,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:43:47,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:43:47,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:43:47,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... [2018-11-28 11:43:47,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:43:47,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:43:47,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:43:47,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:43:47,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/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 [2018-11-28 11:43:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-28 11:43:47,930 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-28 11:43:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:43:47,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:43:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:43:47,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:43:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:43:47,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:43:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 11:43:47,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 11:43:48,302 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:43:48,302 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 11:43:48,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:43:48 BoogieIcfgContainer [2018-11-28 11:43:48,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:43:48,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:43:48,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:43:48,306 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:43:48,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:43:47" (1/3) ... [2018-11-28 11:43:48,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686d8dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:43:48, skipping insertion in model container [2018-11-28 11:43:48,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:47" (2/3) ... [2018-11-28 11:43:48,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686d8dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:43:48, skipping insertion in model container [2018-11-28 11:43:48,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:43:48" (3/3) ... [2018-11-28 11:43:48,308 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2_false-no-overflow.i [2018-11-28 11:43:48,314 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:43:48,319 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-11-28 11:43:48,329 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-11-28 11:43:48,351 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:43:48,351 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:43:48,351 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:43:48,351 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:43:48,352 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:43:48,352 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:43:48,352 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:43:48,352 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:43:48,352 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:43:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-11-28 11:43:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 11:43:48,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:48,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:48,374 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:48,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1025559455, now seen corresponding path program 1 times [2018-11-28 11:43:48,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:48,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:48,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:48,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-28 11:43:48,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 11:43:48,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:43:48,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:43:48,471 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-11-28 11:43:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:48,488 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2018-11-28 11:43:48,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:43:48,489 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-28 11:43:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:48,495 INFO L225 Difference]: With dead ends: 154 [2018-11-28 11:43:48,495 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 11:43:48,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:43:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 11:43:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-28 11:43:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 11:43:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2018-11-28 11:43:48,525 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 9 [2018-11-28 11:43:48,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:48,525 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2018-11-28 11:43:48,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 11:43:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2018-11-28 11:43:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 11:43:48,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:48,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:48,527 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:48,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash -133733111, now seen corresponding path program 1 times [2018-11-28 11:43:48,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:48,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:48,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:48,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:48,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:48,611 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand 3 states. [2018-11-28 11:43:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:48,732 INFO L93 Difference]: Finished difference Result 150 states and 217 transitions. [2018-11-28 11:43:48,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:48,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 11:43:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:48,733 INFO L225 Difference]: With dead ends: 150 [2018-11-28 11:43:48,733 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 11:43:48,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 11:43:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-28 11:43:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 11:43:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2018-11-28 11:43:48,741 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 18 [2018-11-28 11:43:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:48,741 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2018-11-28 11:43:48,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2018-11-28 11:43:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:43:48,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:48,742 INFO L402 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] [2018-11-28 11:43:48,742 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:48,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash -375227645, now seen corresponding path program 1 times [2018-11-28 11:43:48,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:48,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:48,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:48,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:43:48,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:43:48,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:43:48,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:43:48,822 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand 4 states. [2018-11-28 11:43:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:48,993 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2018-11-28 11:43:48,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:43:48,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-28 11:43:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:48,995 INFO L225 Difference]: With dead ends: 219 [2018-11-28 11:43:48,995 INFO L226 Difference]: Without dead ends: 172 [2018-11-28 11:43:48,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:43:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-28 11:43:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2018-11-28 11:43:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-28 11:43:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 166 transitions. [2018-11-28 11:43:49,005 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 166 transitions. Word has length 25 [2018-11-28 11:43:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:49,005 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 166 transitions. [2018-11-28 11:43:49,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:43:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 166 transitions. [2018-11-28 11:43:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 11:43:49,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:49,006 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:49,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:49,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:49,007 INFO L82 PathProgramCache]: Analyzing trace with hash -740983547, now seen corresponding path program 1 times [2018-11-28 11:43:49,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:49,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:49,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:49,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 11:43:49,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:49,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:43:49,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:43:49,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:43:49,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:43:49,088 INFO L87 Difference]: Start difference. First operand 124 states and 166 transitions. Second operand 4 states. [2018-11-28 11:43:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:49,252 INFO L93 Difference]: Finished difference Result 319 states and 452 transitions. [2018-11-28 11:43:49,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:43:49,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-28 11:43:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:49,254 INFO L225 Difference]: With dead ends: 319 [2018-11-28 11:43:49,254 INFO L226 Difference]: Without dead ends: 227 [2018-11-28 11:43:49,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:43:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-28 11:43:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 163. [2018-11-28 11:43:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-28 11:43:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 227 transitions. [2018-11-28 11:43:49,267 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 227 transitions. Word has length 32 [2018-11-28 11:43:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:49,267 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 227 transitions. [2018-11-28 11:43:49,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:43:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 227 transitions. [2018-11-28 11:43:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 11:43:49,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:49,269 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:49,270 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:49,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:49,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1838487559, now seen corresponding path program 1 times [2018-11-28 11:43:49,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:49,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 11:43:49,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:49,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:43:49,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:43:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:43:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:43:49,342 INFO L87 Difference]: Start difference. First operand 163 states and 227 transitions. Second operand 5 states. [2018-11-28 11:43:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:49,522 INFO L93 Difference]: Finished difference Result 460 states and 643 transitions. [2018-11-28 11:43:49,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:43:49,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-28 11:43:49,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:49,523 INFO L225 Difference]: With dead ends: 460 [2018-11-28 11:43:49,523 INFO L226 Difference]: Without dead ends: 327 [2018-11-28 11:43:49,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:43:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-28 11:43:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 176. [2018-11-28 11:43:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-28 11:43:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2018-11-28 11:43:49,536 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 39 [2018-11-28 11:43:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:49,536 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2018-11-28 11:43:49,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:43:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2018-11-28 11:43:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 11:43:49,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:49,538 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:49,538 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:49,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:49,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1692244499, now seen corresponding path program 1 times [2018-11-28 11:43:49,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:49,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:49,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:49,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 11:43:49,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:49,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:43:49,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:43:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:43:49,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:43:49,617 INFO L87 Difference]: Start difference. First operand 176 states and 243 transitions. Second operand 5 states. [2018-11-28 11:43:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:49,791 INFO L93 Difference]: Finished difference Result 466 states and 649 transitions. [2018-11-28 11:43:49,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:43:49,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-28 11:43:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:49,792 INFO L225 Difference]: With dead ends: 466 [2018-11-28 11:43:49,792 INFO L226 Difference]: Without dead ends: 333 [2018-11-28 11:43:49,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:43:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-28 11:43:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 189. [2018-11-28 11:43:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-28 11:43:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 257 transitions. [2018-11-28 11:43:49,801 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 257 transitions. Word has length 42 [2018-11-28 11:43:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:49,801 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 257 transitions. [2018-11-28 11:43:49,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:43:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 257 transitions. [2018-11-28 11:43:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 11:43:49,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:49,803 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:49,803 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:49,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash -756319486, now seen corresponding path program 1 times [2018-11-28 11:43:49,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:49,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:49,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 11:43:49,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:49,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:43:49,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:43:49,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:43:49,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:43:49,871 INFO L87 Difference]: Start difference. First operand 189 states and 257 transitions. Second operand 5 states. [2018-11-28 11:43:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:49,888 INFO L93 Difference]: Finished difference Result 320 states and 444 transitions. [2018-11-28 11:43:49,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:43:49,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 11:43:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:49,889 INFO L225 Difference]: With dead ends: 320 [2018-11-28 11:43:49,889 INFO L226 Difference]: Without dead ends: 164 [2018-11-28 11:43:49,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:43:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-28 11:43:49,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-11-28 11:43:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-28 11:43:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 224 transitions. [2018-11-28 11:43:49,898 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 224 transitions. Word has length 45 [2018-11-28 11:43:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:49,898 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 224 transitions. [2018-11-28 11:43:49,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:43:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 224 transitions. [2018-11-28 11:43:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 11:43:49,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:49,900 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:49,900 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:49,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:49,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1331615022, now seen corresponding path program 1 times [2018-11-28 11:43:49,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:49,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:43:49,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:49,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:49,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:49,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:49,957 INFO L87 Difference]: Start difference. First operand 164 states and 224 transitions. Second operand 3 states. [2018-11-28 11:43:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:49,969 INFO L93 Difference]: Finished difference Result 221 states and 304 transitions. [2018-11-28 11:43:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:49,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-28 11:43:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:49,971 INFO L225 Difference]: With dead ends: 221 [2018-11-28 11:43:49,971 INFO L226 Difference]: Without dead ends: 191 [2018-11-28 11:43:49,972 INFO L631 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 [2018-11-28 11:43:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-28 11:43:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-11-28 11:43:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-28 11:43:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2018-11-28 11:43:49,980 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 51 [2018-11-28 11:43:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:49,980 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2018-11-28 11:43:49,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2018-11-28 11:43:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 11:43:49,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:49,982 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:49,983 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:49,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash 822141932, now seen corresponding path program 1 times [2018-11-28 11:43:49,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:49,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 11:43:50,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:50,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:43:50,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:43:50,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:43:50,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:43:50,045 INFO L87 Difference]: Start difference. First operand 191 states and 262 transitions. Second operand 4 states. [2018-11-28 11:43:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:50,115 INFO L93 Difference]: Finished difference Result 377 states and 533 transitions. [2018-11-28 11:43:50,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:43:50,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-28 11:43:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:50,116 INFO L225 Difference]: With dead ends: 377 [2018-11-28 11:43:50,116 INFO L226 Difference]: Without dead ends: 214 [2018-11-28 11:43:50,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:43:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-28 11:43:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 158. [2018-11-28 11:43:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-28 11:43:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 215 transitions. [2018-11-28 11:43:50,122 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 215 transitions. Word has length 51 [2018-11-28 11:43:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:50,123 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 215 transitions. [2018-11-28 11:43:50,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:43:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 215 transitions. [2018-11-28 11:43:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:43:50,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:50,124 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:50,125 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:50,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:50,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1861436546, now seen corresponding path program 1 times [2018-11-28 11:43:50,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:50,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:50,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:50,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:50,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:43:50,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:43:50,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:43:50,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:50,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:43:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 11:43:50,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:43:50,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-28 11:43:50,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:43:50,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:43:50,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:43:50,313 INFO L87 Difference]: Start difference. First operand 158 states and 215 transitions. Second operand 7 states. [2018-11-28 11:43:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:50,929 INFO L93 Difference]: Finished difference Result 432 states and 613 transitions. [2018-11-28 11:43:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:43:50,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-11-28 11:43:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:50,933 INFO L225 Difference]: With dead ends: 432 [2018-11-28 11:43:50,933 INFO L226 Difference]: Without dead ends: 265 [2018-11-28 11:43:50,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:43:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-28 11:43:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 187. [2018-11-28 11:43:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-28 11:43:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 228 transitions. [2018-11-28 11:43:50,941 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 228 transitions. Word has length 69 [2018-11-28 11:43:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:50,941 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 228 transitions. [2018-11-28 11:43:50,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:43:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 228 transitions. [2018-11-28 11:43:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 11:43:50,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:50,942 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:50,943 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:50,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash 315577703, now seen corresponding path program 1 times [2018-11-28 11:43:50,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:50,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:50,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 15 proven. 43 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:43:51,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:43:51,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:43:51,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:51,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:43:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-28 11:43:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:43:51,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2018-11-28 11:43:51,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:43:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:43:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:43:51,206 INFO L87 Difference]: Start difference. First operand 187 states and 228 transitions. Second operand 13 states. [2018-11-28 11:43:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:53,240 INFO L93 Difference]: Finished difference Result 2187 states and 2688 transitions. [2018-11-28 11:43:53,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-28 11:43:53,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-11-28 11:43:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:53,244 INFO L225 Difference]: With dead ends: 2187 [2018-11-28 11:43:53,244 INFO L226 Difference]: Without dead ends: 1931 [2018-11-28 11:43:53,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=432, Invalid=1638, Unknown=0, NotChecked=0, Total=2070 [2018-11-28 11:43:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2018-11-28 11:43:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 573. [2018-11-28 11:43:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-11-28 11:43:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 756 transitions. [2018-11-28 11:43:53,264 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 756 transitions. Word has length 85 [2018-11-28 11:43:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:53,264 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 756 transitions. [2018-11-28 11:43:53,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:43:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 756 transitions. [2018-11-28 11:43:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 11:43:53,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:53,265 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:53,266 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:53,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:53,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1239538884, now seen corresponding path program 1 times [2018-11-28 11:43:53,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:53,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:53,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:43:53,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:43:53,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:43:53,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:53,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:43:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-28 11:43:53,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:43:53,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-11-28 11:43:53,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:43:53,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:43:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:43:53,507 INFO L87 Difference]: Start difference. First operand 573 states and 756 transitions. Second operand 11 states. [2018-11-28 11:43:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:53,812 INFO L93 Difference]: Finished difference Result 1747 states and 2217 transitions. [2018-11-28 11:43:53,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:43:53,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2018-11-28 11:43:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:53,815 INFO L225 Difference]: With dead ends: 1747 [2018-11-28 11:43:53,815 INFO L226 Difference]: Without dead ends: 1207 [2018-11-28 11:43:53,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-28 11:43:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-11-28 11:43:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 724. [2018-11-28 11:43:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-28 11:43:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 938 transitions. [2018-11-28 11:43:53,834 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 938 transitions. Word has length 88 [2018-11-28 11:43:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:53,834 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 938 transitions. [2018-11-28 11:43:53,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:43:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 938 transitions. [2018-11-28 11:43:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 11:43:53,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:53,835 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:53,836 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:53,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash -447883456, now seen corresponding path program 1 times [2018-11-28 11:43:53,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:53,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:53,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:53,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:53,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-28 11:43:53,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:53,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:43:53,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:43:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:43:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:43:53,918 INFO L87 Difference]: Start difference. First operand 724 states and 938 transitions. Second operand 8 states. [2018-11-28 11:43:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:54,545 INFO L93 Difference]: Finished difference Result 2092 states and 2724 transitions. [2018-11-28 11:43:54,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:43:54,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-11-28 11:43:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:54,550 INFO L225 Difference]: With dead ends: 2092 [2018-11-28 11:43:54,550 INFO L226 Difference]: Without dead ends: 1360 [2018-11-28 11:43:54,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:43:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2018-11-28 11:43:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1098. [2018-11-28 11:43:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2018-11-28 11:43:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1409 transitions. [2018-11-28 11:43:54,593 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1409 transitions. Word has length 88 [2018-11-28 11:43:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:54,594 INFO L480 AbstractCegarLoop]: Abstraction has 1098 states and 1409 transitions. [2018-11-28 11:43:54,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:43:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1409 transitions. [2018-11-28 11:43:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 11:43:54,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:54,596 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:54,597 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:54,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:54,597 INFO L82 PathProgramCache]: Analyzing trace with hash 255085468, now seen corresponding path program 1 times [2018-11-28 11:43:54,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:54,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:54,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:54,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:54,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 11:43:54,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:43:54,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:43:54,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:54,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:43:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 11:43:54,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:43:54,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-28 11:43:54,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:43:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:43:54,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:43:54,959 INFO L87 Difference]: Start difference. First operand 1098 states and 1409 transitions. Second operand 14 states. [2018-11-28 11:43:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:55,540 INFO L93 Difference]: Finished difference Result 3725 states and 4497 transitions. [2018-11-28 11:43:55,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 11:43:55,541 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-11-28 11:43:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:55,545 INFO L225 Difference]: With dead ends: 3725 [2018-11-28 11:43:55,545 INFO L226 Difference]: Without dead ends: 2248 [2018-11-28 11:43:55,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-11-28 11:43:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2018-11-28 11:43:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 627. [2018-11-28 11:43:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-28 11:43:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 842 transitions. [2018-11-28 11:43:55,583 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 842 transitions. Word has length 90 [2018-11-28 11:43:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:55,584 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 842 transitions. [2018-11-28 11:43:55,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:43:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 842 transitions. [2018-11-28 11:43:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 11:43:55,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:55,585 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:55,586 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:55,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash 650017622, now seen corresponding path program 1 times [2018-11-28 11:43:55,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:55,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:55,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:55,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:55,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 11:43:55,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:43:55,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b190c643-82ca-4163-a976-231662f88a7e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:43:55,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:55,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:43:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-28 11:43:55,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:43:55,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2018-11-28 11:43:55,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:43:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:43:55,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:43:55,842 INFO L87 Difference]: Start difference. First operand 627 states and 842 transitions. Second operand 8 states. [2018-11-28 11:43:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:56,129 INFO L93 Difference]: Finished difference Result 1602 states and 2135 transitions. [2018-11-28 11:43:56,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:43:56,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-11-28 11:43:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:56,131 INFO L225 Difference]: With dead ends: 1602 [2018-11-28 11:43:56,131 INFO L226 Difference]: Without dead ends: 741 [2018-11-28 11:43:56,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:43:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-28 11:43:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 723. [2018-11-28 11:43:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-11-28 11:43:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 961 transitions. [2018-11-28 11:43:56,161 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 961 transitions. Word has length 96 [2018-11-28 11:43:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:56,161 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 961 transitions. [2018-11-28 11:43:56,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:43:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 961 transitions. [2018-11-28 11:43:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-28 11:43:56,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:56,162 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:56,163 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 11:43:56,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1017750731, now seen corresponding path program 1 times [2018-11-28 11:43:56,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:56,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:56,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:56,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:56,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:43:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:43:56,237 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:43:56,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:43:56 BoogieIcfgContainer [2018-11-28 11:43:56,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:43:56,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:43:56,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:43:56,290 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:43:56,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:43:48" (3/4) ... [2018-11-28 11:43:56,293 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:43:56,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:43:56,294 INFO L168 Benchmark]: Toolchain (without parser) took 8641.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.7 MB). Free memory was 959.7 MB in the beginning and 1.3 GB in the end (delta: -327.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:43:56,295 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:43:56,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.41 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:43:56,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.25 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:43:56,296 INFO L168 Benchmark]: Boogie Preprocessor took 58.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:43:56,296 INFO L168 Benchmark]: RCFGBuilder took 410.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:43:56,296 INFO L168 Benchmark]: TraceAbstraction took 7986.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 213.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -202.1 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:43:56,297 INFO L168 Benchmark]: Witness Printer took 3.58 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:43:56,299 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.41 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.25 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 410.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7986.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 213.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -202.1 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.58 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L106] a = __VERIFIER_nondet_uint() [L108] b = 234770789 VAL [a=-2382254337, b=234770789] [L110] CALL mp_add(a, b) VAL [\old(a)=1912712959, \old(b)=234770789] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L40] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L49] nb = (unsigned char)4 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=65106, r0=917074] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] COND TRUE i == (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] EXPR partial_sum + a1 [L66] partial_sum = partial_sum + a1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=917074] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=917074] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=917074] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L67] COND TRUE i == (unsigned char)2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L67] EXPR partial_sum + a2 [L67] partial_sum = partial_sum + a2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=917074, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=917074, r1=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=917074, r1=0] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L64] COND TRUE i < na VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L68] COND TRUE i == (unsigned char)3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L68] EXPR partial_sum + a3 [L68] partial_sum = partial_sum + a3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=917074, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L76] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r1 << 8U VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r2 << 16U VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r3 << 24U VAL [\old(a)=1912712959, \old(b)=234770789, a=1912712959, a0=-2382254337, a1=-9305682, a2=-36351, a3=-142, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 126 locations, 38 error locations. UNSAFE Result, 7.9s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1708 SDtfs, 3724 SDslu, 4707 SDs, 0 SdLazy, 4742 SolverSat, 464 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 591 GetRequests, 439 SyntacticMatches, 15 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 4287 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1362 NumberOfCodeBlocks, 1362 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1236 ConstructedInterpolants, 66 QuantifiedInterpolants, 548074 SizeOfPredicates, 12 NumberOfNonLiveVariables, 913 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 862/984 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...