./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_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan --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 Taipan --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_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/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-11-10 13:27:38,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:27:38,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:27:38,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:27:38,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:27:38,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:27:38,653 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:27:38,655 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:27:38,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:27:38,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:27:38,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:27:38,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:27:38,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:27:38,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:27:38,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:27:38,659 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:27:38,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:27:38,660 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:27:38,662 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:27:38,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:27:38,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:27:38,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:27:38,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:27:38,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:27:38,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:27:38,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:27:38,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:27:38,666 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:27:38,667 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:27:38,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:27:38,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:27:38,668 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:27:38,668 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:27:38,668 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:27:38,669 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:27:38,669 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:27:38,669 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-10 13:27:38,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:27:38,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:27:38,677 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:27:38,677 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:27:38,677 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:27:38,677 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:27:38,677 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:27:38,677 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:27:38,677 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:27:38,678 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:27:38,678 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:27:38,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:27:38,678 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:27:38,678 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:27:38,678 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:27:38,679 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:27:38,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:27:38,679 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:27:38,679 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:27:38,679 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:27:38,679 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 13:27:38,679 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:27:38,679 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:27:38,679 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:27:38,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:27:38,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:27:38,680 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:27:38,680 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:27:38,680 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:27:38,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:27:38,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:27:38,680 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:27:38,680 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:27:38,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:27:38,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:27:38,681 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:27:38,681 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c172e82b435756efbbcf3396e72051c66081518f [2018-11-10 13:27:38,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:27:38,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:27:38,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:27:38,709 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:27:38,709 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:27:38,709 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i [2018-11-10 13:27:38,744 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/data/d4a3546f3/d064640aa5f0414f9250cb9818b12126/FLAG935b63196 [2018-11-10 13:27:39,160 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:27:39,161 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/sv-benchmarks/c/bitvector/byte_add_1_false-no-overflow.i [2018-11-10 13:27:39,165 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/data/d4a3546f3/d064640aa5f0414f9250cb9818b12126/FLAG935b63196 [2018-11-10 13:27:39,175 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/data/d4a3546f3/d064640aa5f0414f9250cb9818b12126 [2018-11-10 13:27:39,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:27:39,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:27:39,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:27:39,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:27:39,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:27:39,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc2202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39, skipping insertion in model container [2018-11-10 13:27:39,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:27:39,213 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:27:39,342 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:27:39,344 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:27:39,364 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:27:39,372 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:27:39,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39 WrapperNode [2018-11-10 13:27:39,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:27:39,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:27:39,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:27:39,373 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:27:39,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:27:39,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:27:39,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:27:39,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:27:39,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... [2018-11-10 13:27:39,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:27:39,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:27:39,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:27:39,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:27:39,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:27:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:27:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:27:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-10 13:27:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-10 13:27:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:27:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:27:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:27:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:27:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 13:27:39,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 13:27:39,791 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:27:39,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:27:39 BoogieIcfgContainer [2018-11-10 13:27:39,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:27:39,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:27:39,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:27:39,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:27:39,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:27:39" (1/3) ... [2018-11-10 13:27:39,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41388eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:27:39, skipping insertion in model container [2018-11-10 13:27:39,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:39" (2/3) ... [2018-11-10 13:27:39,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41388eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:27:39, skipping insertion in model container [2018-11-10 13:27:39,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:27:39" (3/3) ... [2018-11-10 13:27:39,798 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1_false-no-overflow.i [2018-11-10 13:27:39,806 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:27:39,811 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-11-10 13:27:39,820 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-11-10 13:27:39,844 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:27:39,845 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:27:39,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:27:39,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:27:39,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:27:39,845 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:27:39,845 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:27:39,845 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:27:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-11-10 13:27:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 13:27:39,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:39,862 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:39,864 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:39,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash 695440543, now seen corresponding path program 1 times [2018-11-10 13:27:39,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:39,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:39,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:39,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:39,905 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:39,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:39,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 13:27:39,958 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:39,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:27:39,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:27:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:27:39,969 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-11-10 13:27:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:39,986 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-11-10 13:27:39,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:27:39,987 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-10 13:27:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:39,993 INFO L225 Difference]: With dead ends: 157 [2018-11-10 13:27:39,993 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 13:27:39,995 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-11-10 13:27:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 13:27:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-10 13:27:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 13:27:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-11-10 13:27:40,021 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-11-10 13:27:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:40,022 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-11-10 13:27:40,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:27:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-11-10 13:27:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 13:27:40,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:40,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:40,024 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:40,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:40,024 INFO L82 PathProgramCache]: Analyzing trace with hash 159052589, now seen corresponding path program 1 times [2018-11-10 13:27:40,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:40,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:40,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,026 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:40,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:27:40,081 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:40,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:40,082 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-11-10 13:27:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:40,238 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-11-10 13:27:40,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:40,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 13:27:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:40,239 INFO L225 Difference]: With dead ends: 156 [2018-11-10 13:27:40,239 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 13:27:40,240 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-11-10 13:27:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 13:27:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-10 13:27:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 13:27:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-11-10 13:27:40,245 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-11-10 13:27:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:40,246 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-11-10 13:27:40,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-10 13:27:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 13:27:40,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:40,247 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:40,247 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:40,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash -729622569, now seen corresponding path program 1 times [2018-11-10 13:27:40,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:40,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,249 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:40,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:40,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:27:40,311 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:40,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:27:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:27:40,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:27:40,312 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-11-10 13:27:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:40,460 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2018-11-10 13:27:40,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:27:40,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-10 13:27:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:40,461 INFO L225 Difference]: With dead ends: 203 [2018-11-10 13:27:40,461 INFO L226 Difference]: Without dead ends: 154 [2018-11-10 13:27:40,462 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-11-10 13:27:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-10 13:27:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-11-10 13:27:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 13:27:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2018-11-10 13:27:40,470 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 28 [2018-11-10 13:27:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:40,471 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2018-11-10 13:27:40,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:27:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2018-11-10 13:27:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 13:27:40,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:40,472 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:40,473 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:40,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:40,473 INFO L82 PathProgramCache]: Analyzing trace with hash -562350907, now seen corresponding path program 1 times [2018-11-10 13:27:40,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:40,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:40,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,474 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:27:40,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:40,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:27:40,536 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:40,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:27:40,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:27:40,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:27:40,537 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand 4 states. [2018-11-10 13:27:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:40,747 INFO L93 Difference]: Finished difference Result 303 states and 414 transitions. [2018-11-10 13:27:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:27:40,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-10 13:27:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:40,748 INFO L225 Difference]: With dead ends: 303 [2018-11-10 13:27:40,748 INFO L226 Difference]: Without dead ends: 207 [2018-11-10 13:27:40,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:27:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-10 13:27:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 171. [2018-11-10 13:27:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 13:27:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-11-10 13:27:40,758 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 36 [2018-11-10 13:27:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:40,759 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-11-10 13:27:40,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:27:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-11-10 13:27:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 13:27:40,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:40,760 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:40,761 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:40,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash -980375313, now seen corresponding path program 1 times [2018-11-10 13:27:40,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:40,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:40,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:40,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 13:27:40,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:40,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:27:40,826 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:40,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:27:40,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:27:40,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:27:40,827 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 5 states. [2018-11-10 13:27:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:40,984 INFO L93 Difference]: Finished difference Result 482 states and 629 transitions. [2018-11-10 13:27:40,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:27:40,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-10 13:27:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:40,986 INFO L225 Difference]: With dead ends: 482 [2018-11-10 13:27:40,986 INFO L226 Difference]: Without dead ends: 342 [2018-11-10 13:27:40,986 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-11-10 13:27:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-10 13:27:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-11-10 13:27:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-10 13:27:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 240 transitions. [2018-11-10 13:27:40,997 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 240 transitions. Word has length 44 [2018-11-10 13:27:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:40,998 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 240 transitions. [2018-11-10 13:27:40,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:27:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 240 transitions. [2018-11-10 13:27:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 13:27:40,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:40,999 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:41,000 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:41,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:41,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1975473950, now seen corresponding path program 1 times [2018-11-10 13:27:41,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:41,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:41,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:41,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:27:41,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:41,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:27:41,056 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:41,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:27:41,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:27:41,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:27:41,057 INFO L87 Difference]: Start difference. First operand 185 states and 240 transitions. Second operand 5 states. [2018-11-10 13:27:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:41,074 INFO L93 Difference]: Finished difference Result 323 states and 422 transitions. [2018-11-10 13:27:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:27:41,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-10 13:27:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:41,075 INFO L225 Difference]: With dead ends: 323 [2018-11-10 13:27:41,075 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 13:27:41,076 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-11-10 13:27:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 13:27:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-10 13:27:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-10 13:27:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2018-11-10 13:27:41,083 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 47 [2018-11-10 13:27:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:41,083 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2018-11-10 13:27:41,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:27:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2018-11-10 13:27:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 13:27:41,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:41,085 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:41,085 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:41,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1557542199, now seen corresponding path program 1 times [2018-11-10 13:27:41,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:41,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:41,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:27:41,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:41,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:27:41,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:41,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:41,139 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand 3 states. [2018-11-10 13:27:41,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:41,148 INFO L93 Difference]: Finished difference Result 223 states and 287 transitions. [2018-11-10 13:27:41,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:41,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-10 13:27:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:41,149 INFO L225 Difference]: With dead ends: 223 [2018-11-10 13:27:41,149 INFO L226 Difference]: Without dead ends: 190 [2018-11-10 13:27:41,149 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-11-10 13:27:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-10 13:27:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-11-10 13:27:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-10 13:27:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 245 transitions. [2018-11-10 13:27:41,156 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 245 transitions. Word has length 53 [2018-11-10 13:27:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:41,157 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 245 transitions. [2018-11-10 13:27:41,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 245 transitions. [2018-11-10 13:27:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 13:27:41,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:41,158 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:41,159 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:41,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1832301813, now seen corresponding path program 1 times [2018-11-10 13:27:41,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:41,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:41,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:41,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:27:41,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:41,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:41,355 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 13:27:41,357 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [164], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:27:41,389 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:41,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:41,501 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:41,561 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:27:41,562 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 13:27:41,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:41,568 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:27:41,686 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 64.65% of their original sizes. [2018-11-10 13:27:41,686 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:27:41,806 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-10 13:27:41,806 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:27:41,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:41,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-10 13:27:41,807 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:41,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:27:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:27:41,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:27:41,808 INFO L87 Difference]: Start difference. First operand 190 states and 245 transitions. Second operand 11 states. [2018-11-10 13:27:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:43,531 INFO L93 Difference]: Finished difference Result 548 states and 709 transitions. [2018-11-10 13:27:43,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:27:43,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-11-10 13:27:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:43,533 INFO L225 Difference]: With dead ends: 548 [2018-11-10 13:27:43,533 INFO L226 Difference]: Without dead ends: 381 [2018-11-10 13:27:43,534 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:27:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-10 13:27:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 201. [2018-11-10 13:27:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 13:27:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 256 transitions. [2018-11-10 13:27:43,546 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 256 transitions. Word has length 53 [2018-11-10 13:27:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:43,546 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 256 transitions. [2018-11-10 13:27:43,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:27:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 256 transitions. [2018-11-10 13:27:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 13:27:43,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:43,549 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, 1, 1, 1] [2018-11-10 13:27:43,549 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:43,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash -309874275, now seen corresponding path program 1 times [2018-11-10 13:27:43,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:43,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:43,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:27:43,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:43,674 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:43,674 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 13:27:43,675 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [58], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [164], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:27:43,677 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:43,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:43,692 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:43,731 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:27:43,731 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 13:27:43,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:43,748 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:27:43,855 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 67.67% of their original sizes. [2018-11-10 13:27:43,855 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:27:44,025 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 13:27:44,025 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:27:44,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:44,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-11-10 13:27:44,026 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:44,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 13:27:44,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 13:27:44,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:27:44,027 INFO L87 Difference]: Start difference. First operand 201 states and 256 transitions. Second operand 12 states. [2018-11-10 13:27:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:45,472 INFO L93 Difference]: Finished difference Result 726 states and 939 transitions. [2018-11-10 13:27:45,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:27:45,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-10 13:27:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:45,473 INFO L225 Difference]: With dead ends: 726 [2018-11-10 13:27:45,473 INFO L226 Difference]: Without dead ends: 559 [2018-11-10 13:27:45,474 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:27:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-11-10 13:27:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 201. [2018-11-10 13:27:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 13:27:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 256 transitions. [2018-11-10 13:27:45,484 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 256 transitions. Word has length 56 [2018-11-10 13:27:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:45,484 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 256 transitions. [2018-11-10 13:27:45,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 13:27:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 256 transitions. [2018-11-10 13:27:45,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 13:27:45,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:45,486 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, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:45,486 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:45,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:45,487 INFO L82 PathProgramCache]: Analyzing trace with hash -658766014, now seen corresponding path program 1 times [2018-11-10 13:27:45,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:45,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:45,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:45,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:45,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:27:45,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:45,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:45,556 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-10 13:27:45,556 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [164], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:27:45,558 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:45,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:45,567 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:45,592 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:27:45,592 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 13:27:45,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:45,594 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:27:45,676 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 69.98% of their original sizes. [2018-11-10 13:27:45,676 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:27:45,927 INFO L415 sIntCurrentIteration]: We unified 58 AI predicates to 58 [2018-11-10 13:27:45,927 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:27:45,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:45,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-11-10 13:27:45,928 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:45,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:27:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:27:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:27:45,929 INFO L87 Difference]: Start difference. First operand 201 states and 256 transitions. Second operand 13 states. [2018-11-10 13:27:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:47,860 INFO L93 Difference]: Finished difference Result 904 states and 1169 transitions. [2018-11-10 13:27:47,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:27:47,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-11-10 13:27:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:47,862 INFO L225 Difference]: With dead ends: 904 [2018-11-10 13:27:47,863 INFO L226 Difference]: Without dead ends: 737 [2018-11-10 13:27:47,863 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-11-10 13:27:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-11-10 13:27:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 201. [2018-11-10 13:27:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 13:27:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 256 transitions. [2018-11-10 13:27:47,874 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 256 transitions. Word has length 59 [2018-11-10 13:27:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:47,874 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 256 transitions. [2018-11-10 13:27:47,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:27:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 256 transitions. [2018-11-10 13:27:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 13:27:47,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:47,875 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, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:47,876 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:47,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1130071299, now seen corresponding path program 1 times [2018-11-10 13:27:47,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:47,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:47,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:27:47,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:47,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:47,945 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-10 13:27:47,945 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [122], [125], [127], [129], [141], [151], [161], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:27:47,947 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:47,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:47,954 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:48,006 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:27:48,006 INFO L272 AbstractInterpreter]: Visited 35 different actions 40 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-10 13:27:48,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:48,016 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:27:48,091 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 66.88% of their original sizes. [2018-11-10 13:27:48,091 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:27:48,317 INFO L415 sIntCurrentIteration]: We unified 58 AI predicates to 58 [2018-11-10 13:27:48,318 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:27:48,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 17 [2018-11-10 13:27:48,318 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:48,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 13:27:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 13:27:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:27:48,319 INFO L87 Difference]: Start difference. First operand 201 states and 256 transitions. Second operand 14 states. [2018-11-10 13:27:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:49,513 INFO L93 Difference]: Finished difference Result 582 states and 746 transitions. [2018-11-10 13:27:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:27:49,513 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-11-10 13:27:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:49,514 INFO L225 Difference]: With dead ends: 582 [2018-11-10 13:27:49,514 INFO L226 Difference]: Without dead ends: 415 [2018-11-10 13:27:49,515 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:27:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-11-10 13:27:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 235. [2018-11-10 13:27:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-10 13:27:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 291 transitions. [2018-11-10 13:27:49,527 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 291 transitions. Word has length 59 [2018-11-10 13:27:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:49,527 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 291 transitions. [2018-11-10 13:27:49,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 13:27:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 291 transitions. [2018-11-10 13:27:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 13:27:49,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:49,528 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:49,529 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:49,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash -481226266, now seen corresponding path program 1 times [2018-11-10 13:27:49,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:49,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:49,530 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:27:49,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:49,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:49,594 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-10 13:27:49,595 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [164], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:27:49,596 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:49,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:49,604 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:49,629 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:27:49,629 INFO L272 AbstractInterpreter]: Visited 30 different actions 30 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 13:27:49,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:49,636 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:27:49,687 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 70.56% of their original sizes. [2018-11-10 13:27:49,687 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:27:49,850 INFO L415 sIntCurrentIteration]: We unified 60 AI predicates to 60 [2018-11-10 13:27:49,851 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:27:49,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:49,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 17 [2018-11-10 13:27:49,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:49,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 13:27:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 13:27:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:27:49,852 INFO L87 Difference]: Start difference. First operand 235 states and 291 transitions. Second operand 14 states. [2018-11-10 13:27:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:51,676 INFO L93 Difference]: Finished difference Result 933 states and 1199 transitions. [2018-11-10 13:27:51,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:27:51,676 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-11-10 13:27:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:51,678 INFO L225 Difference]: With dead ends: 933 [2018-11-10 13:27:51,678 INFO L226 Difference]: Without dead ends: 766 [2018-11-10 13:27:51,679 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:27:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-11-10 13:27:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 230. [2018-11-10 13:27:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 13:27:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2018-11-10 13:27:51,692 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 61 [2018-11-10 13:27:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:51,692 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2018-11-10 13:27:51,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 13:27:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2018-11-10 13:27:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 13:27:51,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:51,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:51,694 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:51,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1592368213, now seen corresponding path program 1 times [2018-11-10 13:27:51,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:51,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:51,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:51,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:51,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:27:51,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:51,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:51,775 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-10 13:27:51,775 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [58], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [122], [125], [127], [129], [141], [151], [161], [170], [174], [182], [188], [194], [197], [199], [205], [209], [211], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:27:51,776 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:51,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:51,783 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:51,834 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:27:51,834 INFO L272 AbstractInterpreter]: Visited 38 different actions 43 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-10 13:27:51,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:51,844 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:27:51,920 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 69.22% of their original sizes. [2018-11-10 13:27:51,920 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:27:52,192 INFO L415 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-11-10 13:27:52,192 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:27:52,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:52,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2018-11-10 13:27:52,192 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:52,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 13:27:52,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 13:27:52,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-10 13:27:52,193 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand 15 states. [2018-11-10 13:27:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:54,127 INFO L93 Difference]: Finished difference Result 778 states and 995 transitions. [2018-11-10 13:27:54,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 13:27:54,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-10 13:27:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:54,129 INFO L225 Difference]: With dead ends: 778 [2018-11-10 13:27:54,129 INFO L226 Difference]: Without dead ends: 611 [2018-11-10 13:27:54,130 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-11-10 13:27:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-10 13:27:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 230. [2018-11-10 13:27:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 13:27:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2018-11-10 13:27:54,159 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 62 [2018-11-10 13:27:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:54,159 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2018-11-10 13:27:54,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 13:27:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2018-11-10 13:27:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 13:27:54,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:54,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:54,160 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:54,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1899455193, now seen corresponding path program 1 times [2018-11-10 13:27:54,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:54,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:54,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:54,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:54,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:54,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:54,239 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:54,239 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-10 13:27:54,239 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [118], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [188], [194], [197], [199], [205], [209], [211], [216], [222], [226], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:27:54,240 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:54,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:54,247 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:27:58,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:27:58,772 INFO L272 AbstractInterpreter]: Visited 54 different actions 1921 times. Merged at 43 different actions 1538 times. Widened at 2 different actions 46 times. Found 326 fixpoints after 14 different actions. Largest state had 22 variables. [2018-11-10 13:27:58,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:58,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:27:58,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:58,777 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:58,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:58,793 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:27:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:58,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 13:27:58,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 13:27:58,963 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:58,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-11-10 13:27:58,964 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:58,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:27:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:27:58,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:27:58,964 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand 4 states. [2018-11-10 13:27:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:59,351 INFO L93 Difference]: Finished difference Result 469 states and 626 transitions. [2018-11-10 13:27:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:27:59,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-11-10 13:27:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:59,353 INFO L225 Difference]: With dead ends: 469 [2018-11-10 13:27:59,353 INFO L226 Difference]: Without dead ends: 302 [2018-11-10 13:27:59,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:27:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-10 13:27:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 276. [2018-11-10 13:27:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-10 13:27:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 338 transitions. [2018-11-10 13:27:59,371 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 338 transitions. Word has length 62 [2018-11-10 13:27:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:59,371 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 338 transitions. [2018-11-10 13:27:59,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:27:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 338 transitions. [2018-11-10 13:27:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 13:27:59,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:59,372 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:59,373 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:59,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash -20052409, now seen corresponding path program 1 times [2018-11-10 13:27:59,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:59,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:59,374 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:27:59,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:59,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:27:59,400 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:59,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:59,400 INFO L87 Difference]: Start difference. First operand 276 states and 338 transitions. Second operand 3 states. [2018-11-10 13:27:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:59,417 INFO L93 Difference]: Finished difference Result 317 states and 385 transitions. [2018-11-10 13:27:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:59,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-10 13:27:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:59,418 INFO L225 Difference]: With dead ends: 317 [2018-11-10 13:27:59,418 INFO L226 Difference]: Without dead ends: 249 [2018-11-10 13:27:59,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-10 13:27:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 220. [2018-11-10 13:27:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-10 13:27:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 269 transitions. [2018-11-10 13:27:59,434 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 269 transitions. Word has length 70 [2018-11-10 13:27:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:59,435 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 269 transitions. [2018-11-10 13:27:59,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 269 transitions. [2018-11-10 13:27:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 13:27:59,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:59,436 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:59,436 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:59,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash -999116813, now seen corresponding path program 1 times [2018-11-10 13:27:59,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:59,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:59,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:59,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:59,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 13:27:59,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:59,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:27:59,482 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:59,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:27:59,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:27:59,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:27:59,483 INFO L87 Difference]: Start difference. First operand 220 states and 269 transitions. Second operand 4 states. [2018-11-10 13:27:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:59,559 INFO L93 Difference]: Finished difference Result 519 states and 648 transitions. [2018-11-10 13:27:59,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:27:59,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-11-10 13:27:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:59,561 INFO L225 Difference]: With dead ends: 519 [2018-11-10 13:27:59,561 INFO L226 Difference]: Without dead ends: 362 [2018-11-10 13:27:59,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:27:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-10 13:27:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 277. [2018-11-10 13:27:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-10 13:27:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 350 transitions. [2018-11-10 13:27:59,581 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 350 transitions. Word has length 76 [2018-11-10 13:27:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:59,581 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 350 transitions. [2018-11-10 13:27:59,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:27:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 350 transitions. [2018-11-10 13:27:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 13:27:59,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:59,582 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:59,582 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:59,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:59,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2028476111, now seen corresponding path program 2 times [2018-11-10 13:27:59,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:59,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:59,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:59,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:59,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:27:59,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:59,633 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:59,633 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:59,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:59,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:59,634 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:59,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:27:59,645 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:27:59,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 13:27:59,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:59,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:27:59,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:27:59,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:59,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2018-11-10 13:27:59,821 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:59,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:27:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:27:59,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:27:59,822 INFO L87 Difference]: Start difference. First operand 277 states and 350 transitions. Second operand 7 states. [2018-11-10 13:28:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:00,080 INFO L93 Difference]: Finished difference Result 611 states and 798 transitions. [2018-11-10 13:28:00,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:28:00,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-11-10 13:28:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:00,082 INFO L225 Difference]: With dead ends: 611 [2018-11-10 13:28:00,082 INFO L226 Difference]: Without dead ends: 364 [2018-11-10 13:28:00,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-11-10 13:28:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-11-10 13:28:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 273. [2018-11-10 13:28:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-10 13:28:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 331 transitions. [2018-11-10 13:28:00,102 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 331 transitions. Word has length 76 [2018-11-10 13:28:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:00,102 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 331 transitions. [2018-11-10 13:28:00,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:28:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 331 transitions. [2018-11-10 13:28:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 13:28:00,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:00,103 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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] [2018-11-10 13:28:00,104 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:28:00,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash 531210933, now seen corresponding path program 1 times [2018-11-10 13:28:00,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:00,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:00,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:28:00,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:00,105 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:28:00,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:00,205 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:28:00,205 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-11-10 13:28:00,206 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:28:00,207 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:28:00,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:28:00,216 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:28:11,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:28:11,225 INFO L272 AbstractInterpreter]: Visited 58 different actions 3929 times. Merged at 47 different actions 2805 times. Widened at 2 different actions 52 times. Found 1029 fixpoints after 24 different actions. Largest state had 22 variables. [2018-11-10 13:28:11,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:11,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:28:11,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:11,227 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:28:11,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:11,234 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:28:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:11,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:28:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 13:28:11,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:28:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 13:28:11,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:28:11,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2018-11-10 13:28:11,492 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:11,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:28:11,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:28:11,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:28:11,493 INFO L87 Difference]: Start difference. First operand 273 states and 331 transitions. Second operand 5 states. [2018-11-10 13:28:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:11,618 INFO L93 Difference]: Finished difference Result 740 states and 909 transitions. [2018-11-10 13:28:11,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:28:11,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-10 13:28:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:11,620 INFO L225 Difference]: With dead ends: 740 [2018-11-10 13:28:11,621 INFO L226 Difference]: Without dead ends: 530 [2018-11-10 13:28:11,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:28:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-11-10 13:28:11,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 482. [2018-11-10 13:28:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-11-10 13:28:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 593 transitions. [2018-11-10 13:28:11,652 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 593 transitions. Word has length 94 [2018-11-10 13:28:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:11,653 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 593 transitions. [2018-11-10 13:28:11,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:28:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 593 transitions. [2018-11-10 13:28:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 13:28:11,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:11,654 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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] [2018-11-10 13:28:11,655 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:28:11,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:11,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1274084595, now seen corresponding path program 1 times [2018-11-10 13:28:11,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:11,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:11,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:11,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:11,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:28:11,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:11,970 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:28:11,970 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-10 13:28:11,970 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [58], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:28:11,971 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:28:11,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:28:11,979 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:28:22,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:28:22,889 INFO L272 AbstractInterpreter]: Visited 61 different actions 4392 times. Merged at 47 different actions 3142 times. Widened at 2 different actions 56 times. Found 1152 fixpoints after 22 different actions. Largest state had 22 variables. [2018-11-10 13:28:22,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:22,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:28:22,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:22,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:28:22,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:22,899 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:28:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:22,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:28:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 13:28:23,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:28:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 73 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 13:28:23,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:28:23,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 7] total 18 [2018-11-10 13:28:23,233 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:23,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:28:23,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:28:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:28:23,234 INFO L87 Difference]: Start difference. First operand 482 states and 593 transitions. Second operand 6 states. [2018-11-10 13:28:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:23,384 INFO L93 Difference]: Finished difference Result 923 states and 1143 transitions. [2018-11-10 13:28:23,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:28:23,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-11-10 13:28:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:23,387 INFO L225 Difference]: With dead ends: 923 [2018-11-10 13:28:23,388 INFO L226 Difference]: Without dead ends: 713 [2018-11-10 13:28:23,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:28:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-11-10 13:28:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 448. [2018-11-10 13:28:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-11-10 13:28:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 558 transitions. [2018-11-10 13:28:23,419 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 558 transitions. Word has length 97 [2018-11-10 13:28:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:23,419 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 558 transitions. [2018-11-10 13:28:23,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:28:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 558 transitions. [2018-11-10 13:28:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 13:28:23,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:23,421 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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, 1] [2018-11-10 13:28:23,421 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:28:23,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1379502856, now seen corresponding path program 1 times [2018-11-10 13:28:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:23,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:23,422 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:28:23,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:23,696 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:28:23,696 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-11-10 13:28:23,696 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:28:23,697 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:28:23,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:28:23,705 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:28:34,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:28:34,268 INFO L272 AbstractInterpreter]: Visited 64 different actions 4267 times. Merged at 47 different actions 3045 times. Widened at 2 different actions 56 times. Found 1121 fixpoints after 24 different actions. Largest state had 22 variables. [2018-11-10 13:28:34,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:34,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:28:34,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:34,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:28:34,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:34,285 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:28:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:34,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:28:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 13:28:34,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:28:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 13:28:34,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:28:34,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-11-10 13:28:34,794 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:28:34,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 13:28:34,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 13:28:34,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:28:34,795 INFO L87 Difference]: Start difference. First operand 448 states and 558 transitions. Second operand 16 states. [2018-11-10 13:28:42,139 WARN L179 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2018-11-10 13:28:42,414 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2018-11-10 13:28:45,278 WARN L179 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2018-11-10 13:28:50,672 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2018-11-10 13:29:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:29:05,767 INFO L93 Difference]: Finished difference Result 2068 states and 2490 transitions. [2018-11-10 13:29:05,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-10 13:29:05,767 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 100 [2018-11-10 13:29:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:29:05,772 INFO L225 Difference]: With dead ends: 2068 [2018-11-10 13:29:05,773 INFO L226 Difference]: Without dead ends: 1653 [2018-11-10 13:29:05,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=916, Invalid=3636, Unknown=4, NotChecked=0, Total=4556 [2018-11-10 13:29:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-11-10 13:29:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 763. [2018-11-10 13:29:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-10 13:29:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 949 transitions. [2018-11-10 13:29:05,871 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 949 transitions. Word has length 100 [2018-11-10 13:29:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:29:05,871 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 949 transitions. [2018-11-10 13:29:05,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 13:29:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 949 transitions. [2018-11-10 13:29:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 13:29:05,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:29:05,873 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:05,873 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:29:05,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:05,874 INFO L82 PathProgramCache]: Analyzing trace with hash 125900066, now seen corresponding path program 1 times [2018-11-10 13:29:05,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:29:05,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:05,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:05,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:05,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:29:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:29:06,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:29:06,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:29:06,141 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2018-11-10 13:29:06,141 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [141], [151], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:29:06,143 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:29:06,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:29:06,153 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:29:15,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:29:15,523 INFO L272 AbstractInterpreter]: Visited 66 different actions 4231 times. Merged at 47 different actions 3022 times. Widened at 2 different actions 54 times. Found 1106 fixpoints after 22 different actions. Largest state had 22 variables. [2018-11-10 13:29:15,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:15,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:29:15,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:29:15,532 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/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-11-10 13:29:15,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:15,539 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:29:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:15,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:29:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 81 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 13:29:15,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:29:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 59 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:29:15,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:29:15,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 6] total 18 [2018-11-10 13:29:15,711 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:29:15,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 13:29:15,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 13:29:15,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:29:15,712 INFO L87 Difference]: Start difference. First operand 763 states and 949 transitions. Second operand 14 states. [2018-11-10 13:29:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:29:16,602 INFO L93 Difference]: Finished difference Result 3515 states and 4220 transitions. [2018-11-10 13:29:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 13:29:16,603 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2018-11-10 13:29:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:29:16,611 INFO L225 Difference]: With dead ends: 3515 [2018-11-10 13:29:16,612 INFO L226 Difference]: Without dead ends: 2672 [2018-11-10 13:29:16,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2018-11-10 13:29:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2018-11-10 13:29:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 884. [2018-11-10 13:29:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-11-10 13:29:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1148 transitions. [2018-11-10 13:29:16,720 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1148 transitions. Word has length 102 [2018-11-10 13:29:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:29:16,720 INFO L481 AbstractCegarLoop]: Abstraction has 884 states and 1148 transitions. [2018-11-10 13:29:16,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 13:29:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1148 transitions. [2018-11-10 13:29:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 13:29:16,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:29:16,723 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:16,723 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:29:16,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash -411407062, now seen corresponding path program 1 times [2018-11-10 13:29:16,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:29:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:16,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:16,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:29:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:29:16,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:29:16,854 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:29:16,854 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2018-11-10 13:29:16,855 INFO L202 CegarAbsIntRunner]: [0], [1], [30], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [73], [76], [79], [81], [83], [85], [89], [91], [93], [95], [99], [101], [103], [105], [109], [111], [113], [115], [122], [125], [127], [129], [131], [141], [151], [155], [157], [159], [161], [164], [168], [170], [174], [176], [180], [182], [186], [188], [192], [194], [197], [199], [205], [209], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 13:29:16,856 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:29:16,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:29:16,866 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:29:27,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:29:27,538 INFO L272 AbstractInterpreter]: Visited 70 different actions 4998 times. Merged at 51 different actions 3462 times. Widened at 2 different actions 54 times. Found 1414 fixpoints after 25 different actions. Largest state had 22 variables. [2018-11-10 13:29:27,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:27,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:29:27,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:29:27,541 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d6b7d71-d5ad-478c-99d0-c4a5df8ecb36/bin-2019/utaipan/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-11-10 13:29:27,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:27,548 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:29:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:29:27,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:29:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 77 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:29:27,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:29:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:29:27,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:29:27,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2018-11-10 13:29:27,732 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:29:27,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:29:27,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:29:27,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:29:27,733 INFO L87 Difference]: Start difference. First operand 884 states and 1148 transitions. Second operand 9 states. [2018-11-10 13:29:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:29:28,084 INFO L93 Difference]: Finished difference Result 2199 states and 2847 transitions. [2018-11-10 13:29:28,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:29:28,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2018-11-10 13:29:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:29:28,087 INFO L225 Difference]: With dead ends: 2199 [2018-11-10 13:29:28,087 INFO L226 Difference]: Without dead ends: 992 [2018-11-10 13:29:28,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-11-10 13:29:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-10 13:29:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 628. [2018-11-10 13:29:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-11-10 13:29:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 803 transitions. [2018-11-10 13:29:28,131 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 803 transitions. Word has length 108 [2018-11-10 13:29:28,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:29:28,132 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 803 transitions. [2018-11-10 13:29:28,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:29:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 803 transitions. [2018-11-10 13:29:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 13:29:28,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:29:28,133 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:29:28,134 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:29:28,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:29:28,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2124362381, now seen corresponding path program 1 times [2018-11-10 13:29:28,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:29:28,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:28,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:29:28,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:29:28,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:29:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:29:28,200 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:29:28,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:29:28 BoogieIcfgContainer [2018-11-10 13:29:28,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:29:28,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:29:28,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:29:28,259 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:29:28,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:27:39" (3/4) ... [2018-11-10 13:29:28,264 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:29:28,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:29:28,265 INFO L168 Benchmark]: Toolchain (without parser) took 109087.97 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -140.8 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-10 13:29:28,265 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:29:28,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.81 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:29:28,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.48 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:29:28,266 INFO L168 Benchmark]: Boogie Preprocessor took 54.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:29:28,267 INFO L168 Benchmark]: RCFGBuilder took 346.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:29:28,267 INFO L168 Benchmark]: TraceAbstraction took 108465.81 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-10 13:29:28,268 INFO L168 Benchmark]: Witness Printer took 5.72 ms. Allocated memory is still 5.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:29:28,270 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.81 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.48 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 346.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108465.81 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 5.72 ms. Allocated memory is still 5.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] b = __VERIFIER_nondet_uint() [L109] a = 234770789 VAL [a=234770789, b=-2382254437] [L111] CALL mp_add(a, b) VAL [\old(a)=234770789, \old(b)=1912712859] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4] [L40] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4] [L49] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, na=4, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=0] [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=101] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=0, na=4, nb=4, partial_sum=256] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=0, na=4, nb=4, partial_sum=65106, r0=917074] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=65106, r0=917074] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=917074] [L66] EXPR partial_sum + a1 [L66] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=917074] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=917074] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, r0=917074] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, r0=917074] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L67] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=917074, r1=0] [L67] EXPR partial_sum + a2 [L67] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=917074, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=917074, r1=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=917074, r1=0] [L76] COND TRUE partial_sum > ((unsigned char)255) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, r0=917074, r1=0] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=917074, r1=0, r2=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L64] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L65] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L68] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=917074, r1=0, r2=0] [L68] EXPR partial_sum + a3 [L68] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=917074, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L76] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r1 << 8U VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r2 << 16U VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] [L97] r3 << 24U VAL [\old(a)=234770789, \old(b)=1912712859, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1912712859, b0=-2382254437, b1=-9305682, b2=-36351, b3=-142, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=917074, r1=0, r2=0, r3=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 38 error locations. UNSAFE Result, 108.4s OverallTime, 23 OverallIterations, 5 TraceHistogramMax, 44.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2684 SDtfs, 6727 SDslu, 7644 SDs, 0 SdLazy, 6509 SolverSat, 583 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 1852 GetRequests, 1551 SyntacticMatches, 12 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 19.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=884occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 57.6s AbstIntTime, 12 AbstIntIterations, 6 AbstIntStrong, 0.9719873150105707 AbsIntWeakeningRatio, 0.5581395348837209 AbsIntAvgWeakeningVarsNumRemoved, 50.479651162790695 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 5978 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2123 NumberOfCodeBlocks, 2078 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2614 ConstructedInterpolants, 226 QuantifiedInterpolants, 1221572 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 36 InterpolantComputations, 13 PerfectInterpolantSequences, 1795/2028 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...