./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/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 c172e82b435756efbbcf3396e72051c66081518f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/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-5842f4b [2018-11-18 16:53:24,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:53:24,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:53:24,180 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:53:24,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:53:24,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:53:24,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:53:24,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:53:24,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:53:24,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:53:24,185 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:53:24,186 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:53:24,186 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:53:24,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:53:24,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:53:24,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:53:24,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:53:24,190 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:53:24,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:53:24,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:53:24,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:53:24,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:53:24,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:53:24,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:53:24,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:53:24,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:53:24,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:53:24,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:53:24,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:53:24,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:53:24,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:53:24,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:53:24,199 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:53:24,200 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:53:24,200 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:53:24,201 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:53:24,201 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-11-18 16:53:24,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:53:24,209 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:53:24,210 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:53:24,210 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:53:24,210 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:53:24,210 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:53:24,211 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:53:24,211 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:53:24,211 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:53:24,211 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:53:24,211 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:53:24,211 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:53:24,212 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:53:24,212 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:53:24,212 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:53:24,212 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:53:24,212 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-18 16:53:24,212 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:53:24,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:53:24,213 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:53:24,213 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:53:24,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:53:24,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:53:24,213 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:53:24,213 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:53:24,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:53:24,214 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:53:24,214 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:53:24,214 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:53:24,214 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:53:24,214 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:53:24,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:53:24,215 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_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/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 -> c172e82b435756efbbcf3396e72051c66081518f [2018-11-18 16:53:24,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:53:24,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:53:24,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:53:24,251 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:53:24,251 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:53:24,252 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i [2018-11-18 16:53:24,290 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/data/785f67729/c21f8b79192142b0b0542ccb5cccbd24/FLAG5f2b0d447 [2018-11-18 16:53:24,586 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:53:24,587 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i [2018-11-18 16:53:24,591 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/data/785f67729/c21f8b79192142b0b0542ccb5cccbd24/FLAG5f2b0d447 [2018-11-18 16:53:24,602 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/bin-2019/uautomizer/data/785f67729/c21f8b79192142b0b0542ccb5cccbd24 [2018-11-18 16:53:24,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:53:24,605 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:53:24,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:53:24,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:53:24,609 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:53:24,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:53:24" (1/1) ... [2018-11-18 16:53:24,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4546e68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24, skipping insertion in model container [2018-11-18 16:53:24,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:53:24" (1/1) ... [2018-11-18 16:53:24,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:53:24,637 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:53:24,769 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:53:24,772 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:53:24,794 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:53:24,802 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:53:24,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24 WrapperNode [2018-11-18 16:53:24,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:53:24,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:53:24,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:53:24,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:53:24,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24" (1/1) ... [2018-11-18 16:53:24,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24" (1/1) ... [2018-11-18 16:53:24,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24" (1/1) ... [2018-11-18 16:53:24,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24" (1/1) ... [2018-11-18 16:53:24,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24" (1/1) ... [2018-11-18 16:53:24,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24" (1/1) ... [2018-11-18 16:53:24,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24" (1/1) ... [2018-11-18 16:53:24,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:53:24,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:53:24,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:53:24,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:53:24,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/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-18 16:53:24,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:53:24,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:53:24,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:53:24,908 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-18 16:53:24,908 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:53:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:53:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 16:53:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:53:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-11-18 16:53:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-11-18 16:53:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-11-18 16:53:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-18 16:53:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:53:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:53:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:53:25,267 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:53:25,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:53:25 BoogieIcfgContainer [2018-11-18 16:53:25,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:53:25,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:53:25,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:53:25,271 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:53:25,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:53:24" (1/3) ... [2018-11-18 16:53:25,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5f3095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:53:25, skipping insertion in model container [2018-11-18 16:53:25,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:24" (2/3) ... [2018-11-18 16:53:25,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5f3095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:53:25, skipping insertion in model container [2018-11-18 16:53:25,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:53:25" (3/3) ... [2018-11-18 16:53:25,274 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1_false-no-overflow.i [2018-11-18 16:53:25,282 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:53:25,288 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-11-18 16:53:25,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-11-18 16:53:25,328 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:53:25,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:53:25,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:53:25,329 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:53:25,329 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:53:25,329 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:53:25,329 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:53:25,329 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:53:25,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:53:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-11-18 16:53:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 16:53:25,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:25,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:25,355 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:25,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1564523809, now seen corresponding path program 1 times [2018-11-18 16:53:25,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:25,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:25,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:25,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:25,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:25,459 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-18 16:53:25,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:25,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-18 16:53:25,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:53:25,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:53:25,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:53:25,472 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-11-18 16:53:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:25,489 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-11-18 16:53:25,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:53:25,490 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-18 16:53:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:25,495 INFO L225 Difference]: With dead ends: 157 [2018-11-18 16:53:25,495 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 16:53:25,497 INFO L604 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-18 16:53:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 16:53:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-18 16:53:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 16:53:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-11-18 16:53:25,525 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-11-18 16:53:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:25,525 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-11-18 16:53:25,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:53:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-11-18 16:53:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:53:25,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:25,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:25,528 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:25,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:25,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1377991052, now seen corresponding path program 1 times [2018-11-18 16:53:25,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:25,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:25,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:25,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:25,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:25,615 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-18 16:53:25,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:25,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:53:25,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:53:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:53:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:53:25,617 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-11-18 16:53:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:25,714 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-11-18 16:53:25,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:53:25,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 16:53:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:25,715 INFO L225 Difference]: With dead ends: 156 [2018-11-18 16:53:25,715 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 16:53:25,716 INFO L604 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-18 16:53:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 16:53:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-18 16:53:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 16:53:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-11-18 16:53:25,724 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-11-18 16:53:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:25,724 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-11-18 16:53:25,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:53:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-18 16:53:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:53:25,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:25,725 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 16:53:25,726 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:25,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1088504138, now seen corresponding path program 1 times [2018-11-18 16:53:25,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:25,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:25,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:25,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:25,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:53:25,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:25,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:53:25,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:53:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:53:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:53:25,792 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-11-18 16:53:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:25,977 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2018-11-18 16:53:25,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:53:25,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-18 16:53:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:25,979 INFO L225 Difference]: With dead ends: 227 [2018-11-18 16:53:25,979 INFO L226 Difference]: Without dead ends: 178 [2018-11-18 16:53:25,979 INFO L604 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-18 16:53:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-18 16:53:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 130. [2018-11-18 16:53:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 16:53:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2018-11-18 16:53:25,988 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 28 [2018-11-18 16:53:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:25,988 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2018-11-18 16:53:25,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:53:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2018-11-18 16:53:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:53:25,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:25,989 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 16:53:25,990 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:25,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:25,990 INFO L82 PathProgramCache]: Analyzing trace with hash 48430116, now seen corresponding path program 1 times [2018-11-18 16:53:25,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:25,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:25,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:25,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:25,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:53:26,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:26,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:53:26,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:53:26,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:53:26,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:53:26,059 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand 4 states. [2018-11-18 16:53:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:26,218 INFO L93 Difference]: Finished difference Result 331 states and 464 transitions. [2018-11-18 16:53:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:53:26,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 16:53:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:26,221 INFO L225 Difference]: With dead ends: 331 [2018-11-18 16:53:26,221 INFO L226 Difference]: Without dead ends: 235 [2018-11-18 16:53:26,221 INFO L604 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-18 16:53:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-18 16:53:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 171. [2018-11-18 16:53:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-18 16:53:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 235 transitions. [2018-11-18 16:53:26,232 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 235 transitions. Word has length 36 [2018-11-18 16:53:26,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:26,233 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 235 transitions. [2018-11-18 16:53:26,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:53:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 235 transitions. [2018-11-18 16:53:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 16:53:26,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:26,234 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 16:53:26,235 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:26,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:26,236 INFO L82 PathProgramCache]: Analyzing trace with hash 740020430, now seen corresponding path program 1 times [2018-11-18 16:53:26,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:26,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:26,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:26,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:26,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 16:53:26,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:26,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:53:26,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:53:26,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:53:26,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:53:26,329 INFO L87 Difference]: Start difference. First operand 171 states and 235 transitions. Second operand 5 states. [2018-11-18 16:53:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:26,508 INFO L93 Difference]: Finished difference Result 482 states and 665 transitions. [2018-11-18 16:53:26,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:53:26,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 16:53:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:26,510 INFO L225 Difference]: With dead ends: 482 [2018-11-18 16:53:26,510 INFO L226 Difference]: Without dead ends: 342 [2018-11-18 16:53:26,511 INFO L604 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-18 16:53:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-18 16:53:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-11-18 16:53:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-18 16:53:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 252 transitions. [2018-11-18 16:53:26,522 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 252 transitions. Word has length 44 [2018-11-18 16:53:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:26,522 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 252 transitions. [2018-11-18 16:53:26,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:53:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 252 transitions. [2018-11-18 16:53:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 16:53:26,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:26,524 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 16:53:26,524 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:26,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1510638398, now seen corresponding path program 1 times [2018-11-18 16:53:26,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:26,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:26,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:26,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:26,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 16:53:26,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:26,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:53:26,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:53:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:53:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:53:26,588 INFO L87 Difference]: Start difference. First operand 185 states and 252 transitions. Second operand 5 states. [2018-11-18 16:53:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:26,623 INFO L93 Difference]: Finished difference Result 323 states and 446 transitions. [2018-11-18 16:53:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:53:26,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-18 16:53:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:26,624 INFO L225 Difference]: With dead ends: 323 [2018-11-18 16:53:26,624 INFO L226 Difference]: Without dead ends: 160 [2018-11-18 16:53:26,624 INFO L604 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-18 16:53:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-18 16:53:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-18 16:53:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-18 16:53:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 219 transitions. [2018-11-18 16:53:26,632 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 219 transitions. Word has length 47 [2018-11-18 16:53:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:26,632 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 219 transitions. [2018-11-18 16:53:26,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:53:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 219 transitions. [2018-11-18 16:53:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 16:53:26,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:26,633 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:26,634 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:26,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash -334415689, now seen corresponding path program 1 times [2018-11-18 16:53:26,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:26,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:26,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:53:26,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:26,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:53:26,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:53:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:53:26,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:53:26,699 INFO L87 Difference]: Start difference. First operand 160 states and 219 transitions. Second operand 3 states. [2018-11-18 16:53:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:26,708 INFO L93 Difference]: Finished difference Result 223 states and 305 transitions. [2018-11-18 16:53:26,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:53:26,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-18 16:53:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:26,709 INFO L225 Difference]: With dead ends: 223 [2018-11-18 16:53:26,709 INFO L226 Difference]: Without dead ends: 190 [2018-11-18 16:53:26,710 INFO L604 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-18 16:53:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-18 16:53:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-11-18 16:53:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-18 16:53:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 260 transitions. [2018-11-18 16:53:26,716 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 260 transitions. Word has length 53 [2018-11-18 16:53:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:26,717 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 260 transitions. [2018-11-18 16:53:26,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:53:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2018-11-18 16:53:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 16:53:26,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:26,718 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:26,719 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:26,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash -59656075, now seen corresponding path program 1 times [2018-11-18 16:53:26,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:26,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:26,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:26,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:26,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 16:53:26,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:26,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/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-18 16:53:26,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:26,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:53:27,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:53:27,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-11-18 16:53:27,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:53:27,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:53:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:53:27,012 INFO L87 Difference]: Start difference. First operand 190 states and 260 transitions. Second operand 11 states. [2018-11-18 16:53:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:27,637 INFO L93 Difference]: Finished difference Result 1064 states and 1496 transitions. [2018-11-18 16:53:27,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 16:53:27,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-11-18 16:53:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:27,639 INFO L225 Difference]: With dead ends: 1064 [2018-11-18 16:53:27,640 INFO L226 Difference]: Without dead ends: 865 [2018-11-18 16:53:27,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-11-18 16:53:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-18 16:53:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 459. [2018-11-18 16:53:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-11-18 16:53:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 607 transitions. [2018-11-18 16:53:27,655 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 607 transitions. Word has length 53 [2018-11-18 16:53:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:27,656 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 607 transitions. [2018-11-18 16:53:27,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:53:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 607 transitions. [2018-11-18 16:53:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 16:53:27,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:27,658 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1] [2018-11-18 16:53:27,659 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:27,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash -17256200, now seen corresponding path program 1 times [2018-11-18 16:53:27,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:27,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:27,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:27,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:27,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 16:53:27,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:27,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/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-18 16:53:27,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:27,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 16:53:27,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:53:27,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-18 16:53:27,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:53:27,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:53:27,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:53:27,811 INFO L87 Difference]: Start difference. First operand 459 states and 607 transitions. Second operand 8 states. [2018-11-18 16:53:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:28,109 INFO L93 Difference]: Finished difference Result 1026 states and 1413 transitions. [2018-11-18 16:53:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:53:28,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-11-18 16:53:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:28,111 INFO L225 Difference]: With dead ends: 1026 [2018-11-18 16:53:28,112 INFO L226 Difference]: Without dead ends: 544 [2018-11-18 16:53:28,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:53:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-11-18 16:53:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 330. [2018-11-18 16:53:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-18 16:53:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 390 transitions. [2018-11-18 16:53:28,123 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 390 transitions. Word has length 74 [2018-11-18 16:53:28,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:28,123 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 390 transitions. [2018-11-18 16:53:28,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:53:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 390 transitions. [2018-11-18 16:53:28,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 16:53:28,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:28,125 INFO L375 BasicCegarLoop]: trace histogram [5, 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] [2018-11-18 16:53:28,126 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:28,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:28,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1972365061, now seen corresponding path program 1 times [2018-11-18 16:53:28,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:28,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:28,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 47 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-18 16:53:28,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:28,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/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-18 16:53:28,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:28,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-18 16:53:28,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:53:28,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2018-11-18 16:53:28,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:53:28,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:53:28,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:53:28,495 INFO L87 Difference]: Start difference. First operand 330 states and 390 transitions. Second operand 13 states. [2018-11-18 16:53:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:29,114 INFO L93 Difference]: Finished difference Result 1690 states and 2004 transitions. [2018-11-18 16:53:29,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 16:53:29,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2018-11-18 16:53:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:29,119 INFO L225 Difference]: With dead ends: 1690 [2018-11-18 16:53:29,120 INFO L226 Difference]: Without dead ends: 1360 [2018-11-18 16:53:29,121 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2018-11-18 16:53:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2018-11-18 16:53:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 436. [2018-11-18 16:53:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-11-18 16:53:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 553 transitions. [2018-11-18 16:53:29,143 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 553 transitions. Word has length 91 [2018-11-18 16:53:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:29,143 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 553 transitions. [2018-11-18 16:53:29,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:53:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 553 transitions. [2018-11-18 16:53:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 16:53:29,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:29,144 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:29,145 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:29,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:29,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1084890781, now seen corresponding path program 1 times [2018-11-18 16:53:29,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:29,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:29,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:29,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:29,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 72 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:53:29,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:29,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ac1edf2-92a9-484a-81c2-7f6ceb2193f9/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-18 16:53:29,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:29,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 16:53:29,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:29,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-18 16:53:29,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:53:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:53:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:53:29,392 INFO L87 Difference]: Start difference. First operand 436 states and 553 transitions. Second operand 11 states. [2018-11-18 16:53:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:29,737 INFO L93 Difference]: Finished difference Result 1121 states and 1427 transitions. [2018-11-18 16:53:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 16:53:29,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-11-18 16:53:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:29,740 INFO L225 Difference]: With dead ends: 1121 [2018-11-18 16:53:29,740 INFO L226 Difference]: Without dead ends: 504 [2018-11-18 16:53:29,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:53:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-11-18 16:53:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 488. [2018-11-18 16:53:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-18 16:53:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 612 transitions. [2018-11-18 16:53:29,756 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 612 transitions. Word has length 97 [2018-11-18 16:53:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:29,756 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 612 transitions. [2018-11-18 16:53:29,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:53:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 612 transitions. [2018-11-18 16:53:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 16:53:29,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:29,757 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 1] [2018-11-18 16:53:29,758 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 16:53:29,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:29,758 INFO L82 PathProgramCache]: Analyzing trace with hash 831355282, now seen corresponding path program 1 times [2018-11-18 16:53:29,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:29,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:29,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:29,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:29,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:53:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:53:29,838 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:53:29,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:53:29 BoogieIcfgContainer [2018-11-18 16:53:29,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:53:29,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:53:29,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:53:29,889 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:53:29,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:53:25" (3/4) ... [2018-11-18 16:53:29,892 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:53:29,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:53:29,893 INFO L168 Benchmark]: Toolchain (without parser) took 5288.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 958.2 MB in the beginning and 1.0 GB in the end (delta: -69.9 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:29,894 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:53:29,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.54 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:29,894 INFO L168 Benchmark]: Boogie Preprocessor took 65.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:29,895 INFO L168 Benchmark]: RCFGBuilder took 398.59 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:29,895 INFO L168 Benchmark]: TraceAbstraction took 4619.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.7 MB). Peak memory consumption was 117.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:29,896 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:53:29,898 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.54 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 398.59 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4619.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.7 MB). Peak memory consumption was 117.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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; [L107] b = __VERIFIER_nondet_uint() [L109] a = 234770789 VAL [a=234770789, b=-2382254437] [L111] CALL mp_add(a, b) VAL [\old(a)=234770789, \old(b)=1912712859] [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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4] [L40] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4] [L49] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, r0=917074] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, 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, 128 locations, 38 error locations. UNSAFE Result, 4.5s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 990 SDtfs, 2536 SDslu, 2395 SDs, 0 SdLazy, 2407 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 327 SyntacticMatches, 9 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=11, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1833 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 852 ConstructedInterpolants, 67 QuantifiedInterpolants, 335788 SizeOfPredicates, 10 NumberOfNonLiveVariables, 663 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 520/610 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...