./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/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_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/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_822c67da-db6f-4ffd-a7b1-b7679de8f78d/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-1dbac8b [2018-10-27 05:47:13,774 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:47:13,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:47:13,785 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:47:13,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:47:13,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:47:13,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:47:13,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:47:13,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:47:13,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:47:13,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:47:13,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:47:13,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:47:13,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:47:13,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:47:13,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:47:13,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:47:13,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:47:13,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:47:13,803 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:47:13,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:47:13,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:47:13,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:47:13,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:47:13,808 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:47:13,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:47:13,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:47:13,811 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:47:13,812 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:47:13,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:47:13,813 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:47:13,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:47:13,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:47:13,815 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:47:13,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:47:13,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:47:13,816 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-10-27 05:47:13,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:47:13,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:47:13,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:47:13,830 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 05:47:13,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 05:47:13,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 05:47:13,831 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 05:47:13,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:47:13,831 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 05:47:13,831 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:47:13,831 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:47:13,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 05:47:13,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:47:13,832 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:47:13,832 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:47:13,832 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:47:13,832 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:47:13,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 05:47:13,833 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:47:13,833 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:47:13,833 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:47:13,833 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:47:13,833 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:47:13,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:47:13,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:47:13,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:47:13,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:47:13,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:47:13,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 05:47:13,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:47:13,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:47:13,837 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_822c67da-db6f-4ffd-a7b1-b7679de8f78d/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-10-27 05:47:13,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:47:13,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:47:13,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:47:13,880 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:47:13,880 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:47:13,881 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i [2018-10-27 05:47:13,931 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/data/250daaa8d/7cc538b1e1914c08bdbd6e422a7f067b/FLAGd4bdd25d1 [2018-10-27 05:47:14,369 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:47:14,373 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i [2018-10-27 05:47:14,382 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/data/250daaa8d/7cc538b1e1914c08bdbd6e422a7f067b/FLAGd4bdd25d1 [2018-10-27 05:47:14,402 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/data/250daaa8d/7cc538b1e1914c08bdbd6e422a7f067b [2018-10-27 05:47:14,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:47:14,408 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 05:47:14,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:47:14,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:47:14,419 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:47:14,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:47:14" (1/1) ... [2018-10-27 05:47:14,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40893eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14, skipping insertion in model container [2018-10-27 05:47:14,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:47:14" (1/1) ... [2018-10-27 05:47:14,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:47:14,477 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:47:14,698 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:47:14,703 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:47:14,763 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:47:14,778 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:47:14,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14 WrapperNode [2018-10-27 05:47:14,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:47:14,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:47:14,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:47:14,780 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:47:14,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14" (1/1) ... [2018-10-27 05:47:14,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14" (1/1) ... [2018-10-27 05:47:14,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14" (1/1) ... [2018-10-27 05:47:14,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14" (1/1) ... [2018-10-27 05:47:14,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14" (1/1) ... [2018-10-27 05:47:14,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14" (1/1) ... [2018-10-27 05:47:14,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14" (1/1) ... [2018-10-27 05:47:14,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:47:14,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:47:14,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:47:14,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:47:14,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/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-10-27 05:47:14,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:47:14,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:47:14,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 05:47:14,943 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-10-27 05:47:14,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:47:14,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 05:47:14,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-10-27 05:47:14,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 05:47:14,944 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2018-10-27 05:47:14,944 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2018-10-27 05:47:14,944 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2018-10-27 05:47:14,944 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-10-27 05:47:14,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:47:14,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:47:14,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:47:15,881 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:47:15,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:47:15 BoogieIcfgContainer [2018-10-27 05:47:15,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:47:15,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:47:15,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:47:15,887 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:47:15,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:47:14" (1/3) ... [2018-10-27 05:47:15,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2a0603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:47:15, skipping insertion in model container [2018-10-27 05:47:15,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:47:14" (2/3) ... [2018-10-27 05:47:15,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2a0603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:47:15, skipping insertion in model container [2018-10-27 05:47:15,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:47:15" (3/3) ... [2018-10-27 05:47:15,892 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1_false-no-overflow.i [2018-10-27 05:47:15,902 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:47:15,912 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-10-27 05:47:15,929 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-10-27 05:47:15,963 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 05:47:15,964 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:47:15,964 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:47:15,965 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:47:15,965 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:47:15,965 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:47:15,966 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:47:15,966 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:47:15,966 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:47:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-10-27 05:47:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 05:47:15,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:15,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:47:16,003 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:16,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:16,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1564523809, now seen corresponding path program 1 times [2018-10-27 05:47:16,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:16,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:16,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:16,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:47:16,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:16,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-27 05:47:16,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 05:47:16,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 05:47:16,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 05:47:16,164 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-10-27 05:47:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:16,192 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-10-27 05:47:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 05:47:16,193 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-10-27 05:47:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:16,205 INFO L225 Difference]: With dead ends: 157 [2018-10-27 05:47:16,205 INFO L226 Difference]: Without dead ends: 76 [2018-10-27 05:47:16,208 INFO L605 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-10-27 05:47:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-27 05:47:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-27 05:47:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-27 05:47:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-10-27 05:47:16,249 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-10-27 05:47:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:16,250 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-10-27 05:47:16,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 05:47:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-10-27 05:47:16,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 05:47:16,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:16,252 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-10-27 05:47:16,254 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:16,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:16,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1377991052, now seen corresponding path program 1 times [2018-10-27 05:47:16,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:16,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:16,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:16,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:16,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:47:16,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:16,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:47:16,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:47:16,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:47:16,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:47:16,389 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-10-27 05:47:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:16,725 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-10-27 05:47:16,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:47:16,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-27 05:47:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:16,727 INFO L225 Difference]: With dead ends: 156 [2018-10-27 05:47:16,727 INFO L226 Difference]: Without dead ends: 107 [2018-10-27 05:47:16,728 INFO L605 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-10-27 05:47:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-27 05:47:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-10-27 05:47:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 05:47:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-10-27 05:47:16,736 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-10-27 05:47:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:16,736 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-10-27 05:47:16,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:47:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-10-27 05:47:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 05:47:16,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:16,737 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-10-27 05:47:16,738 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:16,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:16,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1088504138, now seen corresponding path program 1 times [2018-10-27 05:47:16,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:16,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:16,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:16,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:16,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:47:16,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:16,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:47:16,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:47:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:47:16,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:47:16,842 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-10-27 05:47:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:17,369 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2018-10-27 05:47:17,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:47:17,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-27 05:47:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:17,375 INFO L225 Difference]: With dead ends: 203 [2018-10-27 05:47:17,376 INFO L226 Difference]: Without dead ends: 154 [2018-10-27 05:47:17,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:47:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-27 05:47:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-10-27 05:47:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-27 05:47:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2018-10-27 05:47:17,394 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 28 [2018-10-27 05:47:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:17,395 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2018-10-27 05:47:17,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:47:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2018-10-27 05:47:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 05:47:17,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:17,396 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-10-27 05:47:17,397 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:17,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:17,397 INFO L82 PathProgramCache]: Analyzing trace with hash 48430116, now seen corresponding path program 1 times [2018-10-27 05:47:17,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:17,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:17,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:17,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:17,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 05:47:17,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:17,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:47:17,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:47:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:47:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:47:17,574 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand 4 states. [2018-10-27 05:47:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:17,959 INFO L93 Difference]: Finished difference Result 303 states and 414 transitions. [2018-10-27 05:47:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:47:17,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-10-27 05:47:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:17,961 INFO L225 Difference]: With dead ends: 303 [2018-10-27 05:47:17,961 INFO L226 Difference]: Without dead ends: 207 [2018-10-27 05:47:17,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:47:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-27 05:47:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 171. [2018-10-27 05:47:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-27 05:47:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-10-27 05:47:17,987 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 36 [2018-10-27 05:47:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:17,987 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-10-27 05:47:17,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:47:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-10-27 05:47:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-27 05:47:17,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:17,991 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-10-27 05:47:17,992 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:17,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash 740020430, now seen corresponding path program 1 times [2018-10-27 05:47:17,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:17,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:17,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:17,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:17,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 05:47:18,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:18,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:47:18,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:47:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:47:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:47:18,090 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 5 states. [2018-10-27 05:47:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:18,464 INFO L93 Difference]: Finished difference Result 482 states and 629 transitions. [2018-10-27 05:47:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:47:18,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-27 05:47:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:18,466 INFO L225 Difference]: With dead ends: 482 [2018-10-27 05:47:18,466 INFO L226 Difference]: Without dead ends: 342 [2018-10-27 05:47:18,467 INFO L605 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-10-27 05:47:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-27 05:47:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-10-27 05:47:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-27 05:47:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 240 transitions. [2018-10-27 05:47:18,479 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 240 transitions. Word has length 44 [2018-10-27 05:47:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:18,480 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 240 transitions. [2018-10-27 05:47:18,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:47:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 240 transitions. [2018-10-27 05:47:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 05:47:18,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:18,481 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-10-27 05:47:18,484 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:18,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1510638398, now seen corresponding path program 1 times [2018-10-27 05:47:18,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:18,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:18,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 05:47:18,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:18,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:47:18,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:47:18,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:47:18,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:47:18,585 INFO L87 Difference]: Start difference. First operand 185 states and 240 transitions. Second operand 5 states. [2018-10-27 05:47:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:18,628 INFO L93 Difference]: Finished difference Result 323 states and 422 transitions. [2018-10-27 05:47:18,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:47:18,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-10-27 05:47:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:18,629 INFO L225 Difference]: With dead ends: 323 [2018-10-27 05:47:18,630 INFO L226 Difference]: Without dead ends: 160 [2018-10-27 05:47:18,630 INFO L605 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-10-27 05:47:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-27 05:47:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-10-27 05:47:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-27 05:47:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2018-10-27 05:47:18,640 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 47 [2018-10-27 05:47:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:18,640 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2018-10-27 05:47:18,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:47:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2018-10-27 05:47:18,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 05:47:18,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:18,642 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-10-27 05:47:18,644 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:18,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash -334415689, now seen corresponding path program 1 times [2018-10-27 05:47:18,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:18,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:18,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:18,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:18,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 05:47:18,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:18,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:47:18,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:47:18,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:47:18,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:47:18,751 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand 3 states. [2018-10-27 05:47:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:18,794 INFO L93 Difference]: Finished difference Result 223 states and 287 transitions. [2018-10-27 05:47:18,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:47:18,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-27 05:47:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:18,797 INFO L225 Difference]: With dead ends: 223 [2018-10-27 05:47:18,797 INFO L226 Difference]: Without dead ends: 190 [2018-10-27 05:47:18,798 INFO L605 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-10-27 05:47:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-27 05:47:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-10-27 05:47:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-27 05:47:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 245 transitions. [2018-10-27 05:47:18,806 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 245 transitions. Word has length 53 [2018-10-27 05:47:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:18,807 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 245 transitions. [2018-10-27 05:47:18,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:47:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 245 transitions. [2018-10-27 05:47:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 05:47:18,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:18,808 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-10-27 05:47:18,809 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:18,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash -59656075, now seen corresponding path program 1 times [2018-10-27 05:47:18,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:18,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:18,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:18,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:18,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 05:47:19,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:19,036 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/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-10-27 05:47:19,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:19,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 05:47:19,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:47:19,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-10-27 05:47:19,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 05:47:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 05:47:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:47:19,201 INFO L87 Difference]: Start difference. First operand 190 states and 245 transitions. Second operand 11 states. [2018-10-27 05:47:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:20,526 INFO L93 Difference]: Finished difference Result 933 states and 1244 transitions. [2018-10-27 05:47:20,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 05:47:20,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-10-27 05:47:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:20,529 INFO L225 Difference]: With dead ends: 933 [2018-10-27 05:47:20,529 INFO L226 Difference]: Without dead ends: 721 [2018-10-27 05:47:20,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-10-27 05:47:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-10-27 05:47:20,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 344. [2018-10-27 05:47:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-27 05:47:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 434 transitions. [2018-10-27 05:47:20,551 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 434 transitions. Word has length 53 [2018-10-27 05:47:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:20,551 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 434 transitions. [2018-10-27 05:47:20,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 05:47:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 434 transitions. [2018-10-27 05:47:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 05:47:20,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:20,555 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-10-27 05:47:20,556 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:20,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:20,557 INFO L82 PathProgramCache]: Analyzing trace with hash -17256200, now seen corresponding path program 1 times [2018-10-27 05:47:20,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:20,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:20,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:20,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 05:47:20,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:20,912 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/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-10-27 05:47:20,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:20,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 05:47:21,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:47:21,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-27 05:47:21,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:47:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:47:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:47:21,032 INFO L87 Difference]: Start difference. First operand 344 states and 434 transitions. Second operand 9 states. [2018-10-27 05:47:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:22,006 INFO L93 Difference]: Finished difference Result 824 states and 1097 transitions. [2018-10-27 05:47:22,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 05:47:22,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-10-27 05:47:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:22,012 INFO L225 Difference]: With dead ends: 824 [2018-10-27 05:47:22,012 INFO L226 Difference]: Without dead ends: 472 [2018-10-27 05:47:22,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:47:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-27 05:47:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 358. [2018-10-27 05:47:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-10-27 05:47:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 433 transitions. [2018-10-27 05:47:22,028 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 433 transitions. Word has length 74 [2018-10-27 05:47:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:22,028 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 433 transitions. [2018-10-27 05:47:22,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:47:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 433 transitions. [2018-10-27 05:47:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 05:47:22,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:22,032 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-10-27 05:47:22,035 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:22,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:22,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1972365061, now seen corresponding path program 1 times [2018-10-27 05:47:22,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:22,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:22,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-27 05:47:22,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:22,695 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/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-10-27 05:47:22,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:22,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-27 05:47:22,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:47:22,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2018-10-27 05:47:22,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 05:47:22,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 05:47:22,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:47:22,861 INFO L87 Difference]: Start difference. First operand 358 states and 433 transitions. Second operand 15 states. [2018-10-27 05:47:25,305 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 05:47:26,129 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-27 05:47:26,765 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-27 05:47:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:27,642 INFO L93 Difference]: Finished difference Result 2237 states and 2684 transitions. [2018-10-27 05:47:27,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-27 05:47:27,643 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2018-10-27 05:47:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:27,648 INFO L225 Difference]: With dead ends: 2237 [2018-10-27 05:47:27,648 INFO L226 Difference]: Without dead ends: 1851 [2018-10-27 05:47:27,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=439, Invalid=1541, Unknown=0, NotChecked=0, Total=1980 [2018-10-27 05:47:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2018-10-27 05:47:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 861. [2018-10-27 05:47:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-10-27 05:47:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1138 transitions. [2018-10-27 05:47:27,687 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1138 transitions. Word has length 91 [2018-10-27 05:47:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:27,687 INFO L481 AbstractCegarLoop]: Abstraction has 861 states and 1138 transitions. [2018-10-27 05:47:27,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 05:47:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1138 transitions. [2018-10-27 05:47:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 05:47:27,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:27,689 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:47:27,693 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:27,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash 254142231, now seen corresponding path program 1 times [2018-10-27 05:47:27,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:27,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:27,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:27,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 05:47:28,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:28,564 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/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-10-27 05:47:28,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:28,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-27 05:47:28,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:47:28,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2018-10-27 05:47:28,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 05:47:28,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 05:47:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-27 05:47:28,868 INFO L87 Difference]: Start difference. First operand 861 states and 1138 transitions. Second operand 13 states. [2018-10-27 05:47:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:29,537 INFO L93 Difference]: Finished difference Result 1941 states and 2434 transitions. [2018-10-27 05:47:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 05:47:29,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-10-27 05:47:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:29,544 INFO L225 Difference]: With dead ends: 1941 [2018-10-27 05:47:29,544 INFO L226 Difference]: Without dead ends: 1113 [2018-10-27 05:47:29,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-10-27 05:47:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-10-27 05:47:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 737. [2018-10-27 05:47:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-10-27 05:47:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 932 transitions. [2018-10-27 05:47:29,580 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 932 transitions. Word has length 94 [2018-10-27 05:47:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:29,580 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 932 transitions. [2018-10-27 05:47:29,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 05:47:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 932 transitions. [2018-10-27 05:47:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 05:47:29,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:29,582 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, 1, 1, 1] [2018-10-27 05:47:29,583 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:29,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash -962011495, now seen corresponding path program 2 times [2018-10-27 05:47:29,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:29,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:29,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:29,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-27 05:47:29,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:29,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 05:47:29,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:47:29,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:47:29,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:47:29,785 INFO L87 Difference]: Start difference. First operand 737 states and 932 transitions. Second operand 8 states. [2018-10-27 05:47:31,827 WARN L179 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-10-27 05:47:32,570 WARN L179 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-10-27 05:47:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:33,056 INFO L93 Difference]: Finished difference Result 1623 states and 2057 transitions. [2018-10-27 05:47:33,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 05:47:33,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-10-27 05:47:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:33,061 INFO L225 Difference]: With dead ends: 1623 [2018-10-27 05:47:33,061 INFO L226 Difference]: Without dead ends: 1101 [2018-10-27 05:47:33,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-27 05:47:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2018-10-27 05:47:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 901. [2018-10-27 05:47:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-10-27 05:47:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1133 transitions. [2018-10-27 05:47:33,097 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1133 transitions. Word has length 94 [2018-10-27 05:47:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:33,097 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1133 transitions. [2018-10-27 05:47:33,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:47:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1133 transitions. [2018-10-27 05:47:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 05:47:33,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:33,101 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, 1, 1, 1, 1, 1] [2018-10-27 05:47:33,102 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:33,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:33,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1945628053, now seen corresponding path program 1 times [2018-10-27 05:47:33,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:33,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:33,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:33,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:47:33,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 05:47:33,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:33,305 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:47:33,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:33,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 05:47:33,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:47:33,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-10-27 05:47:33,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 05:47:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 05:47:33,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:47:33,454 INFO L87 Difference]: Start difference. First operand 901 states and 1133 transitions. Second operand 12 states. [2018-10-27 05:47:33,814 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-27 05:47:34,118 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 05:47:34,502 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 05:47:34,936 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-27 05:47:35,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:35,974 INFO L93 Difference]: Finished difference Result 2214 states and 2672 transitions. [2018-10-27 05:47:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:47:35,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-10-27 05:47:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:35,981 INFO L225 Difference]: With dead ends: 2214 [2018-10-27 05:47:35,981 INFO L226 Difference]: Without dead ends: 1351 [2018-10-27 05:47:35,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-10-27 05:47:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2018-10-27 05:47:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 896. [2018-10-27 05:47:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-27 05:47:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1090 transitions. [2018-10-27 05:47:36,021 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1090 transitions. Word has length 96 [2018-10-27 05:47:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:36,021 INFO L481 AbstractCegarLoop]: Abstraction has 896 states and 1090 transitions. [2018-10-27 05:47:36,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 05:47:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1090 transitions. [2018-10-27 05:47:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 05:47:36,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:36,025 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:47:36,027 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:36,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1464547795, now seen corresponding path program 1 times [2018-10-27 05:47:36,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:36,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:36,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:36,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:36,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 37 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-27 05:47:36,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:36,719 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:47:36,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:36,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 47 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-27 05:47:36,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:47:36,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-10-27 05:47:36,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 05:47:36,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 05:47:36,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-27 05:47:36,915 INFO L87 Difference]: Start difference. First operand 896 states and 1090 transitions. Second operand 14 states. [2018-10-27 05:47:37,376 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-10-27 05:47:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:37,876 INFO L93 Difference]: Finished difference Result 1885 states and 2169 transitions. [2018-10-27 05:47:37,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 05:47:37,882 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2018-10-27 05:47:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:37,888 INFO L225 Difference]: With dead ends: 1885 [2018-10-27 05:47:37,888 INFO L226 Difference]: Without dead ends: 1870 [2018-10-27 05:47:37,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-10-27 05:47:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2018-10-27 05:47:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 834. [2018-10-27 05:47:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-10-27 05:47:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1026 transitions. [2018-10-27 05:47:37,932 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1026 transitions. Word has length 96 [2018-10-27 05:47:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:37,932 INFO L481 AbstractCegarLoop]: Abstraction has 834 states and 1026 transitions. [2018-10-27 05:47:37,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 05:47:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1026 transitions. [2018-10-27 05:47:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-27 05:47:37,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:37,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:47:37,937 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:37,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash 394474041, now seen corresponding path program 1 times [2018-10-27 05:47:37,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:37,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:37,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 05:47:38,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:47:38,108 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_822c67da-db6f-4ffd-a7b1-b7679de8f78d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:47:38,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:38,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:47:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-27 05:47:38,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:47:38,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-10-27 05:47:38,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 05:47:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 05:47:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:47:38,320 INFO L87 Difference]: Start difference. First operand 834 states and 1026 transitions. Second operand 10 states. [2018-10-27 05:47:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:39,056 INFO L93 Difference]: Finished difference Result 2113 states and 2602 transitions. [2018-10-27 05:47:39,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 05:47:39,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-10-27 05:47:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:39,062 INFO L225 Difference]: With dead ends: 2113 [2018-10-27 05:47:39,065 INFO L226 Difference]: Without dead ends: 1209 [2018-10-27 05:47:39,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-10-27 05:47:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2018-10-27 05:47:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1168. [2018-10-27 05:47:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-10-27 05:47:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1409 transitions. [2018-10-27 05:47:39,116 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1409 transitions. Word has length 102 [2018-10-27 05:47:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:39,116 INFO L481 AbstractCegarLoop]: Abstraction has 1168 states and 1409 transitions. [2018-10-27 05:47:39,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 05:47:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1409 transitions. [2018-10-27 05:47:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-27 05:47:39,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:39,121 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:47:39,121 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:39,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1865947582, now seen corresponding path program 2 times [2018-10-27 05:47:39,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:39,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:39,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:39,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:47:39,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:47:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-27 05:47:39,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:47:39,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:47:39,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:47:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:47:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:47:39,223 INFO L87 Difference]: Start difference. First operand 1168 states and 1409 transitions. Second operand 3 states. [2018-10-27 05:47:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:47:39,682 INFO L93 Difference]: Finished difference Result 2135 states and 2544 transitions. [2018-10-27 05:47:39,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:47:39,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-10-27 05:47:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:47:39,684 INFO L225 Difference]: With dead ends: 2135 [2018-10-27 05:47:39,684 INFO L226 Difference]: Without dead ends: 501 [2018-10-27 05:47:39,686 INFO L605 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-10-27 05:47:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-10-27 05:47:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 468. [2018-10-27 05:47:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-10-27 05:47:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 554 transitions. [2018-10-27 05:47:39,707 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 554 transitions. Word has length 111 [2018-10-27 05:47:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:47:39,707 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 554 transitions. [2018-10-27 05:47:39,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:47:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 554 transitions. [2018-10-27 05:47:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 05:47:39,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:47:39,709 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-10-27 05:47:39,709 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:47:39,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:47:39,709 INFO L82 PathProgramCache]: Analyzing trace with hash 831355282, now seen corresponding path program 1 times [2018-10-27 05:47:39,710 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:47:39,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:47:39,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:39,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:47:39,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:47:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 05:47:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 05:47:39,809 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 05:47:39,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:47:39 BoogieIcfgContainer [2018-10-27 05:47:39,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:47:39,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:47:39,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:47:39,907 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:47:39,908 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:47:15" (3/4) ... [2018-10-27 05:47:39,913 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 05:47:39,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:47:39,913 INFO L168 Benchmark]: Toolchain (without parser) took 25506.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 959.8 MB in the beginning and 869.2 MB in the end (delta: 90.6 MB). Peak memory consumption was 444.5 MB. Max. memory is 11.5 GB. [2018-10-27 05:47:39,916 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:47:39,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.46 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-10-27 05:47:39,919 INFO L168 Benchmark]: Boogie Preprocessor took 42.67 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:47:39,919 INFO L168 Benchmark]: RCFGBuilder took 1060.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-10-27 05:47:39,919 INFO L168 Benchmark]: TraceAbstraction took 24023.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 869.2 MB in the end (delta: 273.4 MB). Peak memory consumption was 447.0 MB. Max. memory is 11.5 GB. [2018-10-27 05:47:39,920 INFO L168 Benchmark]: Witness Printer took 5.80 ms. Allocated memory is still 1.4 GB. Free memory is still 869.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:47:39,925 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.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.46 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.67 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1060.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24023.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 869.2 MB in the end (delta: 273.4 MB). Peak memory consumption was 447.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.80 ms. Allocated memory is still 1.4 GB. Free memory is still 869.2 MB. 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, 23.9s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 17.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1890 SDtfs, 4617 SDslu, 6447 SDs, 0 SdLazy, 6043 SolverSat, 497 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 795 GetRequests, 613 SyntacticMatches, 11 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1168occurred in iteration=15, 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.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 3843 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1766 NumberOfCodeBlocks, 1766 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1631 ConstructedInterpolants, 88 QuantifiedInterpolants, 725158 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1256 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 1296/1456 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...