./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/bitvector/byte_add_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_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 6af52310ec13e6e7a94146d05f9e904086453aae ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 11:40:42,911 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:40:42,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:40:42,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:40:42,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:40:42,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:40:42,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:40:42,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:40:42,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:40:42,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:40:42,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:40:42,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:40:42,928 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:40:42,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:40:42,929 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:40:42,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:40:42,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:40:42,932 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:40:42,933 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:40:42,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:40:42,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:40:42,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:40:42,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:40:42,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:40:42,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:40:42,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:40:42,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:40:42,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:40:42,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:40:42,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:40:42,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:40:42,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:40:42,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:40:42,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:40:42,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:40:42,944 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:40:42,944 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-10 11:40:42,955 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:40:42,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:40:42,956 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:40:42,956 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:40:42,956 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:40:42,956 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:40:42,956 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:40:42,957 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:40:42,957 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:40:42,957 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:40:42,957 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:40:42,958 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:40:42,958 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:40:42,958 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:40:42,958 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:40:42,958 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:40:42,958 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:40:42,959 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:40:42,959 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:40:42,959 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:40:42,959 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 11:40:42,959 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:40:42,959 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:40:42,959 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:40:42,960 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:40:42,960 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:40:42,960 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:40:42,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:40:42,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:40:42,960 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:40:42,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:40:42,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:40:42,961 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:40:42,961 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:40:42,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:40:42,961 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:40:42,961 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_8765dc5f-63cb-43f6-8b36-6576af509485/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 -> 6af52310ec13e6e7a94146d05f9e904086453aae [2018-11-10 11:40:42,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:40:42,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:40:42,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:40:43,000 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:40:43,001 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:40:43,001 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-11-10 11:40:43,044 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/data/4d93a4816/cc4a5a3e19b54d92a86395cc8f56d5a6/FLAG64147d74f [2018-11-10 11:40:43,382 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:40:43,382 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-11-10 11:40:43,388 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/data/4d93a4816/cc4a5a3e19b54d92a86395cc8f56d5a6/FLAG64147d74f [2018-11-10 11:40:43,399 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/data/4d93a4816/cc4a5a3e19b54d92a86395cc8f56d5a6 [2018-11-10 11:40:43,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:40:43,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:40:43,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:40:43,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:40:43,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:40:43,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a532032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43, skipping insertion in model container [2018-11-10 11:40:43,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:40:43,434 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:40:43,570 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:40:43,574 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:40:43,600 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:40:43,612 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:40:43,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43 WrapperNode [2018-11-10 11:40:43,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:40:43,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:40:43,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:40:43,613 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:40:43,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:40:43,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:40:43,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:40:43,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:40:43,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... [2018-11-10 11:40:43,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:40:43,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:40:43,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:40:43,646 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:40:43,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 11:40:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:40:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:40:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-10 11:40:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-10 11:40:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:40:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:40:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:40:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:40:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 11:40:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 11:40:44,064 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:40:44,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:40:44 BoogieIcfgContainer [2018-11-10 11:40:44,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:40:44,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:40:44,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:40:44,067 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:40:44,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:40:43" (1/3) ... [2018-11-10 11:40:44,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ad311b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:40:44, skipping insertion in model container [2018-11-10 11:40:44,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:43" (2/3) ... [2018-11-10 11:40:44,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ad311b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:40:44, skipping insertion in model container [2018-11-10 11:40:44,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:40:44" (3/3) ... [2018-11-10 11:40:44,070 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2018-11-10 11:40:44,076 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:40:44,081 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-11-10 11:40:44,091 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-11-10 11:40:44,112 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:40:44,112 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:40:44,112 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:40:44,113 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:40:44,113 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:40:44,113 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:40:44,113 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:40:44,113 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:40:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-11-10 11:40:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 11:40:44,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:44,135 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:44,137 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:44,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash 695440543, now seen corresponding path program 1 times [2018-11-10 11:40:44,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:44,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:44,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:44,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:44,175 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:44,224 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 11:40:44,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:44,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 11:40:44,226 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:44,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 11:40:44,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 11:40:44,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 11:40:44,238 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 2 states. [2018-11-10 11:40:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:44,260 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2018-11-10 11:40:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 11:40:44,261 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-10 11:40:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:44,267 INFO L225 Difference]: With dead ends: 157 [2018-11-10 11:40:44,267 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 11:40:44,269 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 11:40:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 11:40:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-10 11:40:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 11:40:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2018-11-10 11:40:44,295 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 9 [2018-11-10 11:40:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:44,295 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2018-11-10 11:40:44,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 11:40:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2018-11-10 11:40:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 11:40:44,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:44,296 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 11:40:44,297 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:44,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:44,298 INFO L82 PathProgramCache]: Analyzing trace with hash 159052589, now seen corresponding path program 1 times [2018-11-10 11:40:44,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:44,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:44,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:44,369 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 11:40:44,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:44,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:40:44,369 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:44,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:40:44,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:40:44,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:40:44,371 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2018-11-10 11:40:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:44,520 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions. [2018-11-10 11:40:44,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:40:44,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 11:40:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:44,521 INFO L225 Difference]: With dead ends: 156 [2018-11-10 11:40:44,521 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 11:40:44,522 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 11:40:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 11:40:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-11-10 11:40:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 11:40:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2018-11-10 11:40:44,528 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 20 [2018-11-10 11:40:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:44,529 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2018-11-10 11:40:44,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:40:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-10 11:40:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 11:40:44,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:44,530 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 11:40:44,531 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:44,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:44,531 INFO L82 PathProgramCache]: Analyzing trace with hash -729622569, now seen corresponding path program 1 times [2018-11-10 11:40:44,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:44,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:44,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:44,533 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:44,609 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 11:40:44,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:44,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:40:44,610 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:44,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:40:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:40:44,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:40:44,611 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand 4 states. [2018-11-10 11:40:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:44,752 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2018-11-10 11:40:44,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:40:44,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-10 11:40:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:44,753 INFO L225 Difference]: With dead ends: 203 [2018-11-10 11:40:44,754 INFO L226 Difference]: Without dead ends: 154 [2018-11-10 11:40:44,754 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 11:40:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-10 11:40:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2018-11-10 11:40:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 11:40:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2018-11-10 11:40:44,764 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 28 [2018-11-10 11:40:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:44,764 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2018-11-10 11:40:44,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:40:44,765 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2018-11-10 11:40:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 11:40:44,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:44,766 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 11:40:44,767 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:44,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:44,767 INFO L82 PathProgramCache]: Analyzing trace with hash -562350907, now seen corresponding path program 1 times [2018-11-10 11:40:44,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:44,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:44,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:44,831 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 11:40:44,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:44,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:40:44,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:44,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:40:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:40:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:40:44,832 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand 4 states. [2018-11-10 11:40:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:45,013 INFO L93 Difference]: Finished difference Result 303 states and 414 transitions. [2018-11-10 11:40:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:40:45,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-10 11:40:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:45,014 INFO L225 Difference]: With dead ends: 303 [2018-11-10 11:40:45,014 INFO L226 Difference]: Without dead ends: 207 [2018-11-10 11:40:45,015 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 11:40:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-10 11:40:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 171. [2018-11-10 11:40:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 11:40:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-11-10 11:40:45,025 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 36 [2018-11-10 11:40:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:45,025 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-11-10 11:40:45,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:40:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-11-10 11:40:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 11:40:45,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:45,027 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 11:40:45,027 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:45,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash -980375313, now seen corresponding path program 1 times [2018-11-10 11:40:45,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:45,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:45,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:45,095 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 11:40:45,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:45,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:40:45,096 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:45,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:40:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:40:45,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:40:45,097 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 5 states. [2018-11-10 11:40:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:45,288 INFO L93 Difference]: Finished difference Result 482 states and 629 transitions. [2018-11-10 11:40:45,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:40:45,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-10 11:40:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:45,290 INFO L225 Difference]: With dead ends: 482 [2018-11-10 11:40:45,290 INFO L226 Difference]: Without dead ends: 342 [2018-11-10 11:40:45,291 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 11:40:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-10 11:40:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 185. [2018-11-10 11:40:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-10 11:40:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 240 transitions. [2018-11-10 11:40:45,302 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 240 transitions. Word has length 44 [2018-11-10 11:40:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:45,303 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 240 transitions. [2018-11-10 11:40:45,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:40:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 240 transitions. [2018-11-10 11:40:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 11:40:45,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:45,305 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 11:40:45,305 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:45,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:45,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1975473950, now seen corresponding path program 1 times [2018-11-10 11:40:45,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:45,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:45,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:45,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:45,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:45,376 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 11:40:45,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:45,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:40:45,377 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:45,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:40:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:40:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:40:45,378 INFO L87 Difference]: Start difference. First operand 185 states and 240 transitions. Second operand 5 states. [2018-11-10 11:40:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:45,553 INFO L93 Difference]: Finished difference Result 490 states and 637 transitions. [2018-11-10 11:40:45,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:40:45,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-10 11:40:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:45,554 INFO L225 Difference]: With dead ends: 490 [2018-11-10 11:40:45,555 INFO L226 Difference]: Without dead ends: 350 [2018-11-10 11:40:45,556 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 11:40:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-10 11:40:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2018-11-10 11:40:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-10 11:40:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 256 transitions. [2018-11-10 11:40:45,564 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 256 transitions. Word has length 47 [2018-11-10 11:40:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:45,565 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 256 transitions. [2018-11-10 11:40:45,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:40:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 256 transitions. [2018-11-10 11:40:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 11:40:45,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:45,566 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, 1, 1, 1] [2018-11-10 11:40:45,568 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:45,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1943837068, now seen corresponding path program 1 times [2018-11-10 11:40:45,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:45,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:45,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:45,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:40:45,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:45,645 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:45,645 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-10 11:40:45,647 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [35], [37], [39], [58], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 11:40:45,694 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:45,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:45,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:45,875 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:45,877 INFO L272 AbstractInterpreter]: Visited 19 different actions 19 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 11:40:45,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:45,892 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:46,005 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 82.4% of their original sizes. [2018-11-10 11:40:46,005 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:46,048 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-10 11:40:46,048 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:46,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:46,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-10 11:40:46,049 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:46,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:40:46,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:40:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:40:46,050 INFO L87 Difference]: Start difference. First operand 200 states and 256 transitions. Second operand 7 states. [2018-11-10 11:40:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:46,884 INFO L93 Difference]: Finished difference Result 949 states and 1235 transitions. [2018-11-10 11:40:46,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:40:46,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-10 11:40:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:46,887 INFO L225 Difference]: With dead ends: 949 [2018-11-10 11:40:46,887 INFO L226 Difference]: Without dead ends: 809 [2018-11-10 11:40:46,888 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:40:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-11-10 11:40:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 205. [2018-11-10 11:40:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 11:40:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. [2018-11-10 11:40:46,900 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 263 transitions. Word has length 50 [2018-11-10 11:40:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:46,900 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 263 transitions. [2018-11-10 11:40:46,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:40:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 263 transitions. [2018-11-10 11:40:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 11:40:46,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:46,902 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, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:46,902 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:46,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1484555764, now seen corresponding path program 1 times [2018-11-10 11:40:46,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:46,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:46,905 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:40:46,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:46,967 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:46,967 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 11:40:46,967 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [35], [37], [39], [58], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 11:40:46,969 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:46,969 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:46,980 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:46,993 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:46,994 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 11:40:46,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:46,996 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:47,045 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 84.53% of their original sizes. [2018-11-10 11:40:47,046 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:47,080 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-10 11:40:47,080 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:47,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:47,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-10 11:40:47,081 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:47,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:40:47,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:40:47,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:40:47,081 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. Second operand 8 states. [2018-11-10 11:40:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:47,588 INFO L93 Difference]: Finished difference Result 1119 states and 1455 transitions. [2018-11-10 11:40:47,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:40:47,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-10 11:40:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:47,590 INFO L225 Difference]: With dead ends: 1119 [2018-11-10 11:40:47,590 INFO L226 Difference]: Without dead ends: 979 [2018-11-10 11:40:47,591 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:40:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-11-10 11:40:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 205. [2018-11-10 11:40:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 11:40:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. [2018-11-10 11:40:47,599 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 263 transitions. Word has length 53 [2018-11-10 11:40:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:47,599 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 263 transitions. [2018-11-10 11:40:47,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:40:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 263 transitions. [2018-11-10 11:40:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 11:40:47,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:47,600 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, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:47,601 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:47,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:47,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1294932405, now seen corresponding path program 1 times [2018-11-10 11:40:47,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:47,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:47,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:47,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:47,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:40:47,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:47,673 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:47,673 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 11:40:47,673 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 11:40:47,674 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:47,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:47,681 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:47,689 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:47,689 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 11:40:47,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:47,690 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:47,724 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 82.92% of their original sizes. [2018-11-10 11:40:47,724 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:47,769 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-10 11:40:47,769 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:47,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:47,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-10 11:40:47,769 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:47,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:40:47,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:40:47,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:40:47,770 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. Second operand 8 states. [2018-11-10 11:40:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:48,759 INFO L93 Difference]: Finished difference Result 1106 states and 1438 transitions. [2018-11-10 11:40:48,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:40:48,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-10 11:40:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:48,762 INFO L225 Difference]: With dead ends: 1106 [2018-11-10 11:40:48,762 INFO L226 Difference]: Without dead ends: 966 [2018-11-10 11:40:48,762 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:40:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-11-10 11:40:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 213. [2018-11-10 11:40:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-10 11:40:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2018-11-10 11:40:48,770 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 53 [2018-11-10 11:40:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:48,770 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2018-11-10 11:40:48,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:40:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2018-11-10 11:40:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 11:40:48,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:48,771 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:48,772 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:48,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1735225144, now seen corresponding path program 1 times [2018-11-10 11:40:48,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:48,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:48,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:48,773 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:40:48,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:48,825 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:48,825 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 11:40:48,825 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [18], [20], [22], [32], [35], [37], [39], [58], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 11:40:48,827 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:48,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:48,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:48,841 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:48,841 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 11:40:48,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:48,842 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:48,871 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 85.18% of their original sizes. [2018-11-10 11:40:48,872 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:48,925 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-10 11:40:48,925 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:48,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:48,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 11:40:48,926 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:48,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:40:48,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:40:48,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:48,927 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand 9 states. [2018-11-10 11:40:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:49,487 INFO L93 Difference]: Finished difference Result 1123 states and 1459 transitions. [2018-11-10 11:40:49,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:40:49,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-10 11:40:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:49,489 INFO L225 Difference]: With dead ends: 1123 [2018-11-10 11:40:49,490 INFO L226 Difference]: Without dead ends: 983 [2018-11-10 11:40:49,490 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2018-11-10 11:40:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 208. [2018-11-10 11:40:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-10 11:40:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 267 transitions. [2018-11-10 11:40:49,499 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 267 transitions. Word has length 55 [2018-11-10 11:40:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:49,499 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 267 transitions. [2018-11-10 11:40:49,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:40:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 267 transitions. [2018-11-10 11:40:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 11:40:49,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:49,500 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:49,500 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:49,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash 873473489, now seen corresponding path program 1 times [2018-11-10 11:40:49,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:49,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:40:49,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:49,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:49,550 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 11:40:49,550 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 11:40:49,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:49,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:49,559 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:49,568 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:49,568 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 11:40:49,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:49,570 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:49,603 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 83.12% of their original sizes. [2018-11-10 11:40:49,604 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:49,657 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-10 11:40:49,658 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:49,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:49,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 11:40:49,658 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:49,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:40:49,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:40:49,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:49,659 INFO L87 Difference]: Start difference. First operand 208 states and 267 transitions. Second operand 9 states. [2018-11-10 11:40:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:50,453 INFO L93 Difference]: Finished difference Result 1104 states and 1432 transitions. [2018-11-10 11:40:50,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:40:50,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-10 11:40:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:50,456 INFO L225 Difference]: With dead ends: 1104 [2018-11-10 11:40:50,456 INFO L226 Difference]: Without dead ends: 964 [2018-11-10 11:40:50,456 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-11-10 11:40:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 210. [2018-11-10 11:40:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-10 11:40:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 269 transitions. [2018-11-10 11:40:50,467 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 269 transitions. Word has length 55 [2018-11-10 11:40:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:50,467 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 269 transitions. [2018-11-10 11:40:50,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:40:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 269 transitions. [2018-11-10 11:40:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 11:40:50,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:50,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:50,468 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:50,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2071475659, now seen corresponding path program 1 times [2018-11-10 11:40:50,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:50,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:50,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:40:50,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:50,514 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:50,514 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 11:40:50,514 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 11:40:50,515 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:50,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:50,521 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:50,530 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:50,530 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 11:40:50,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:50,544 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:50,571 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 84.79% of their original sizes. [2018-11-10 11:40:50,571 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:50,616 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 11:40:50,616 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:50,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:50,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 11:40:50,617 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:50,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:40:50,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:40:50,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:50,617 INFO L87 Difference]: Start difference. First operand 210 states and 269 transitions. Second operand 9 states. [2018-11-10 11:40:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:51,200 INFO L93 Difference]: Finished difference Result 1263 states and 1641 transitions. [2018-11-10 11:40:51,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:40:51,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-11-10 11:40:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:51,202 INFO L225 Difference]: With dead ends: 1263 [2018-11-10 11:40:51,203 INFO L226 Difference]: Without dead ends: 1123 [2018-11-10 11:40:51,204 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-10 11:40:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 218. [2018-11-10 11:40:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-10 11:40:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 280 transitions. [2018-11-10 11:40:51,215 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 280 transitions. Word has length 56 [2018-11-10 11:40:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:51,215 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 280 transitions. [2018-11-10 11:40:51,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:40:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 280 transitions. [2018-11-10 11:40:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 11:40:51,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:51,216 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 11:40:51,216 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:51,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1520788288, now seen corresponding path program 1 times [2018-11-10 11:40:51,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:51,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:51,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:51,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:51,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:51,265 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 11:40:51,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:51,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:40:51,265 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:51,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:40:51,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:40:51,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:40:51,266 INFO L87 Difference]: Start difference. First operand 218 states and 280 transitions. Second operand 3 states. [2018-11-10 11:40:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:51,286 INFO L93 Difference]: Finished difference Result 281 states and 360 transitions. [2018-11-10 11:40:51,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:40:51,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-10 11:40:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:51,288 INFO L225 Difference]: With dead ends: 281 [2018-11-10 11:40:51,288 INFO L226 Difference]: Without dead ends: 248 [2018-11-10 11:40:51,288 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 11:40:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-10 11:40:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-11-10 11:40:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-10 11:40:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2018-11-10 11:40:51,297 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 56 [2018-11-10 11:40:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:51,298 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2018-11-10 11:40:51,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:40:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2018-11-10 11:40:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 11:40:51,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:51,298 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 11:40:51,299 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:51,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1246028674, now seen corresponding path program 1 times [2018-11-10 11:40:51,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:51,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:51,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:51,357 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 11:40:51,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:51,357 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:51,357 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 11:40:51,358 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [61], [63], [67], [71], [73], [118], [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 11:40:51,359 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:51,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:51,364 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:51,368 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:51,368 INFO L272 AbstractInterpreter]: Visited 18 different actions 18 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 11:40:51,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:51,370 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:51,395 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 78.34% of their original sizes. [2018-11-10 11:40:51,396 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:51,441 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 11:40:51,442 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:51,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:51,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-10 11:40:51,442 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:51,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:40:51,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:40:51,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:40:51,443 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand 7 states. [2018-11-10 11:40:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:51,732 INFO L93 Difference]: Finished difference Result 964 states and 1244 transitions. [2018-11-10 11:40:51,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:40:51,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-11-10 11:40:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:51,734 INFO L225 Difference]: With dead ends: 964 [2018-11-10 11:40:51,734 INFO L226 Difference]: Without dead ends: 796 [2018-11-10 11:40:51,735 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:40:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-11-10 11:40:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 248. [2018-11-10 11:40:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-10 11:40:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2018-11-10 11:40:51,746 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 56 [2018-11-10 11:40:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:51,746 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2018-11-10 11:40:51,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:40:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2018-11-10 11:40:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 11:40:51,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:51,747 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 11:40:51,748 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:51,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:51,748 INFO L82 PathProgramCache]: Analyzing trace with hash -309874275, now seen corresponding path program 1 times [2018-11-10 11:40:51,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:51,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:51,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:51,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:51,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:51,841 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 11:40:51,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:51,841 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:51,841 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 11:40:51,841 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 11:40:51,843 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:51,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:51,847 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:51,854 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:51,854 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 11:40:51,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:51,856 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:51,889 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 71.79% of their original sizes. [2018-11-10 11:40:51,889 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:51,949 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 11:40:51,949 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:51,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:51,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2018-11-10 11:40:51,949 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:51,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:40:51,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:40:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:40:51,950 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand 8 states. [2018-11-10 11:40:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:52,496 INFO L93 Difference]: Finished difference Result 952 states and 1232 transitions. [2018-11-10 11:40:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:40:52,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-10 11:40:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:52,497 INFO L225 Difference]: With dead ends: 952 [2018-11-10 11:40:52,498 INFO L226 Difference]: Without dead ends: 785 [2018-11-10 11:40:52,498 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:40:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-11-10 11:40:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 248. [2018-11-10 11:40:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-10 11:40:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2018-11-10 11:40:52,510 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 56 [2018-11-10 11:40:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:52,510 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2018-11-10 11:40:52,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:40:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2018-11-10 11:40:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 11:40:52,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:52,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:52,511 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:52,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash 966863473, now seen corresponding path program 1 times [2018-11-10 11:40:52,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:52,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:52,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:52,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:52,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:40:52,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:52,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:52,553 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-10 11:40:52,553 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [18], [20], [22], [32], [35], [37], [39], [42], [44], [46], [55], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 11:40:52,554 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:52,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:52,564 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:52,572 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:52,572 INFO L272 AbstractInterpreter]: Visited 27 different actions 27 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 11:40:52,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:52,575 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:52,603 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 85.31% of their original sizes. [2018-11-10 11:40:52,604 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:52,657 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-10 11:40:52,657 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:52,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:52,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-10 11:40:52,658 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:52,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 11:40:52,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:40:52,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:40:52,659 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand 10 states. [2018-11-10 11:40:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:53,308 INFO L93 Difference]: Finished difference Result 1499 states and 1940 transitions. [2018-11-10 11:40:53,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:40:53,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-10 11:40:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:53,310 INFO L225 Difference]: With dead ends: 1499 [2018-11-10 11:40:53,310 INFO L226 Difference]: Without dead ends: 1329 [2018-11-10 11:40:53,311 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:40:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-11-10 11:40:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 240. [2018-11-10 11:40:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-10 11:40:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 307 transitions. [2018-11-10 11:40:53,325 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 307 transitions. Word has length 58 [2018-11-10 11:40:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:53,325 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 307 transitions. [2018-11-10 11:40:53,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 11:40:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 307 transitions. [2018-11-10 11:40:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 11:40:53,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:53,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:53,326 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:53,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash -134302127, now seen corresponding path program 1 times [2018-11-10 11:40:53,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:53,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:53,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:53,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:53,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:40:53,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:53,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:53,377 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-10 11:40:53,377 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 11:40:53,378 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:53,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:53,384 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:53,393 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:53,393 INFO L272 AbstractInterpreter]: Visited 27 different actions 27 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 11:40:53,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:53,394 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:53,419 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 84.88% of their original sizes. [2018-11-10 11:40:53,420 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:53,474 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-10 11:40:53,475 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:53,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:53,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-10 11:40:53,475 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:53,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 11:40:53,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:40:53,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:40:53,476 INFO L87 Difference]: Start difference. First operand 240 states and 307 transitions. Second operand 10 states. [2018-11-10 11:40:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:54,123 INFO L93 Difference]: Finished difference Result 1502 states and 1941 transitions. [2018-11-10 11:40:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:40:54,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-10 11:40:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:54,126 INFO L225 Difference]: With dead ends: 1502 [2018-11-10 11:40:54,126 INFO L226 Difference]: Without dead ends: 1332 [2018-11-10 11:40:54,127 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:40:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-11-10 11:40:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 242. [2018-11-10 11:40:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-10 11:40:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 310 transitions. [2018-11-10 11:40:54,140 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 310 transitions. Word has length 58 [2018-11-10 11:40:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:54,140 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 310 transitions. [2018-11-10 11:40:54,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 11:40:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 310 transitions. [2018-11-10 11:40:54,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 11:40:54,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:54,141 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 11:40:54,141 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:54,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1872665598, now seen corresponding path program 1 times [2018-11-10 11:40:54,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:54,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:54,142 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:54,195 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 11:40:54,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:54,195 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:54,195 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-10 11:40:54,195 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [61], [63], [67], [71], [73], [118], [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 11:40:54,196 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:54,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:54,203 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:54,208 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:54,208 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 11:40:54,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:54,209 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:54,228 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 81.49% of their original sizes. [2018-11-10 11:40:54,228 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:54,269 INFO L415 sIntCurrentIteration]: We unified 58 AI predicates to 58 [2018-11-10 11:40:54,269 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:54,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:54,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-10 11:40:54,269 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:54,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 11:40:54,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:40:54,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:40:54,270 INFO L87 Difference]: Start difference. First operand 242 states and 310 transitions. Second operand 8 states. [2018-11-10 11:40:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:54,992 INFO L93 Difference]: Finished difference Result 1144 states and 1476 transitions. [2018-11-10 11:40:54,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:40:54,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-10 11:40:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:54,995 INFO L225 Difference]: With dead ends: 1144 [2018-11-10 11:40:54,995 INFO L226 Difference]: Without dead ends: 976 [2018-11-10 11:40:54,995 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:40:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-11-10 11:40:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 240. [2018-11-10 11:40:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-10 11:40:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 307 transitions. [2018-11-10 11:40:55,007 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 307 transitions. Word has length 59 [2018-11-10 11:40:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:55,008 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 307 transitions. [2018-11-10 11:40:55,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 11:40:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 307 transitions. [2018-11-10 11:40:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 11:40:55,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:55,008 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 11:40:55,009 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:55,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash -658766014, now seen corresponding path program 1 times [2018-11-10 11:40:55,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:55,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:55,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:55,048 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 11:40:55,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:55,049 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:55,049 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-10 11:40:55,049 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 11:40:55,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:55,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:55,056 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:55,064 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:55,065 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 11:40:55,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:55,071 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:55,095 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 74.49% of their original sizes. [2018-11-10 11:40:55,096 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:55,158 INFO L415 sIntCurrentIteration]: We unified 58 AI predicates to 58 [2018-11-10 11:40:55,158 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:55,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:55,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 11:40:55,159 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:55,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:40:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:40:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:55,159 INFO L87 Difference]: Start difference. First operand 240 states and 307 transitions. Second operand 9 states. [2018-11-10 11:40:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:55,743 INFO L93 Difference]: Finished difference Result 1122 states and 1451 transitions. [2018-11-10 11:40:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:40:55,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-10 11:40:55,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:55,745 INFO L225 Difference]: With dead ends: 1122 [2018-11-10 11:40:55,746 INFO L226 Difference]: Without dead ends: 955 [2018-11-10 11:40:55,746 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-10 11:40:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 240. [2018-11-10 11:40:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-10 11:40:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 307 transitions. [2018-11-10 11:40:55,759 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 307 transitions. Word has length 59 [2018-11-10 11:40:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:55,759 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 307 transitions. [2018-11-10 11:40:55,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:40:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 307 transitions. [2018-11-10 11:40:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 11:40:55,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:55,760 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 11:40:55,760 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:55,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1130071299, now seen corresponding path program 1 times [2018-11-10 11:40:55,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:55,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:55,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:55,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:55,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:55,809 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 11:40:55,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:55,809 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:55,809 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-10 11:40:55,810 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 11:40:55,811 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:55,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:55,817 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:55,842 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:55,842 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 11:40:55,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:55,844 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:55,900 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 67.72% of their original sizes. [2018-11-10 11:40:55,900 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:56,010 INFO L415 sIntCurrentIteration]: We unified 58 AI predicates to 58 [2018-11-10 11:40:56,010 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:56,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:56,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-10 11:40:56,010 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:56,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 11:40:56,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:40:56,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:40:56,011 INFO L87 Difference]: Start difference. First operand 240 states and 307 transitions. Second operand 10 states. [2018-11-10 11:40:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:56,560 INFO L93 Difference]: Finished difference Result 800 states and 1028 transitions. [2018-11-10 11:40:56,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:40:56,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-10 11:40:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:56,562 INFO L225 Difference]: With dead ends: 800 [2018-11-10 11:40:56,562 INFO L226 Difference]: Without dead ends: 633 [2018-11-10 11:40:56,563 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:40:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-11-10 11:40:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 274. [2018-11-10 11:40:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 11:40:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2018-11-10 11:40:56,578 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 59 [2018-11-10 11:40:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:56,578 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2018-11-10 11:40:56,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 11:40:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2018-11-10 11:40:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 11:40:56,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:56,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:56,579 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:56,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash -868157555, now seen corresponding path program 1 times [2018-11-10 11:40:56,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:56,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:56,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:40:56,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:56,618 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:56,619 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-10 11:40:56,619 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [18], [20], [22], [32], [35], [37], [39], [42], [44], [46], [49], [51], [53], [63], [67], [71], [205], [209], [211], [214], [216], [220], [222], [226], [228], [234], [237], [239], [244], [246], [248], [250], [251], [259], [275], [276], [277], [279] [2018-11-10 11:40:56,620 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:56,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:56,624 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:56,630 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:56,630 INFO L272 AbstractInterpreter]: Visited 29 different actions 29 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 11:40:56,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:56,632 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:56,653 INFO L227 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 85.35% of their original sizes. [2018-11-10 11:40:56,653 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:56,716 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-10 11:40:56,716 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:56,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:56,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-10 11:40:56,716 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:56,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 11:40:56,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:40:56,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:40:56,717 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand 11 states. [2018-11-10 11:40:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:57,506 INFO L93 Difference]: Finished difference Result 1524 states and 1961 transitions. [2018-11-10 11:40:57,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:40:57,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-10 11:40:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:57,510 INFO L225 Difference]: With dead ends: 1524 [2018-11-10 11:40:57,510 INFO L226 Difference]: Without dead ends: 1354 [2018-11-10 11:40:57,510 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:40:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-10 11:40:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 259. [2018-11-10 11:40:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-10 11:40:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 323 transitions. [2018-11-10 11:40:57,527 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 323 transitions. Word has length 60 [2018-11-10 11:40:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:57,527 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 323 transitions. [2018-11-10 11:40:57,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 11:40:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 323 transitions. [2018-11-10 11:40:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 11:40:57,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:57,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 11:40:57,528 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:57,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:57,528 INFO L82 PathProgramCache]: Analyzing trace with hash 597983810, now seen corresponding path program 1 times [2018-11-10 11:40:57,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:57,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:57,529 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:57,580 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 11:40:57,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:57,580 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:57,580 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-10 11:40:57,580 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [18], [20], [22], [32], [61], [63], [67], [71], [73], [118], [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 11:40:57,581 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:57,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:57,586 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:57,591 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:57,591 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 11:40:57,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:57,592 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:57,611 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 82.49% of their original sizes. [2018-11-10 11:40:57,611 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:57,660 INFO L415 sIntCurrentIteration]: We unified 60 AI predicates to 60 [2018-11-10 11:40:57,660 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:57,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:57,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 11:40:57,660 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:57,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:40:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:40:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:57,661 INFO L87 Difference]: Start difference. First operand 259 states and 323 transitions. Second operand 9 states. [2018-11-10 11:40:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:58,096 INFO L93 Difference]: Finished difference Result 1166 states and 1496 transitions. [2018-11-10 11:40:58,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:40:58,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-10 11:40:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:58,098 INFO L225 Difference]: With dead ends: 1166 [2018-11-10 11:40:58,098 INFO L226 Difference]: Without dead ends: 998 [2018-11-10 11:40:58,098 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-11-10 11:40:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 253. [2018-11-10 11:40:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 11:40:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 315 transitions. [2018-11-10 11:40:58,114 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 315 transitions. Word has length 61 [2018-11-10 11:40:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:58,114 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 315 transitions. [2018-11-10 11:40:58,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:40:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 315 transitions. [2018-11-10 11:40:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 11:40:58,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:58,115 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 11:40:58,115 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:58,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:58,115 INFO L82 PathProgramCache]: Analyzing trace with hash -481226266, now seen corresponding path program 1 times [2018-11-10 11:40:58,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:58,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:58,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:58,161 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 11:40:58,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:58,162 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:58,162 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-10 11:40:58,162 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 11:40:58,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:58,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:58,167 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:58,176 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:58,176 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 11:40:58,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:58,178 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:58,203 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 75.23% of their original sizes. [2018-11-10 11:40:58,203 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:58,267 INFO L415 sIntCurrentIteration]: We unified 60 AI predicates to 60 [2018-11-10 11:40:58,267 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:58,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:58,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-10 11:40:58,268 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:58,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 11:40:58,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:40:58,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:40:58,268 INFO L87 Difference]: Start difference. First operand 253 states and 315 transitions. Second operand 10 states. [2018-11-10 11:40:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:58,840 INFO L93 Difference]: Finished difference Result 1129 states and 1453 transitions. [2018-11-10 11:40:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:40:58,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-11-10 11:40:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:58,842 INFO L225 Difference]: With dead ends: 1129 [2018-11-10 11:40:58,842 INFO L226 Difference]: Without dead ends: 962 [2018-11-10 11:40:58,842 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:40:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-11-10 11:40:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 240. [2018-11-10 11:40:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-10 11:40:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 300 transitions. [2018-11-10 11:40:58,860 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 300 transitions. Word has length 61 [2018-11-10 11:40:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:58,861 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 300 transitions. [2018-11-10 11:40:58,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 11:40:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 300 transitions. [2018-11-10 11:40:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 11:40:58,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:58,861 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 11:40:58,862 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:58,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:58,862 INFO L82 PathProgramCache]: Analyzing trace with hash 339951792, now seen corresponding path program 1 times [2018-11-10 11:40:58,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:58,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:58,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:58,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:58,903 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 11:40:58,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:58,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:58,904 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-10 11:40:58,904 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [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 11:40:58,905 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:58,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:58,911 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:58,927 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:58,927 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 11:40:58,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:58,929 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:58,971 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 71.63% of their original sizes. [2018-11-10 11:40:58,971 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:40:59,084 INFO L415 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-11-10 11:40:59,084 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:40:59,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:59,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-10 11:40:59,084 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:59,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 11:40:59,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:40:59,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:40:59,085 INFO L87 Difference]: Start difference. First operand 240 states and 300 transitions. Second operand 11 states. [2018-11-10 11:40:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:59,789 INFO L93 Difference]: Finished difference Result 995 states and 1273 transitions. [2018-11-10 11:40:59,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:40:59,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-11-10 11:40:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:59,791 INFO L225 Difference]: With dead ends: 995 [2018-11-10 11:40:59,791 INFO L226 Difference]: Without dead ends: 828 [2018-11-10 11:40:59,792 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:40:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2018-11-10 11:40:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 240. [2018-11-10 11:40:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-10 11:40:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 300 transitions. [2018-11-10 11:40:59,807 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 300 transitions. Word has length 62 [2018-11-10 11:40:59,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:59,807 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 300 transitions. [2018-11-10 11:40:59,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 11:40:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 300 transitions. [2018-11-10 11:40:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 11:40:59,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:59,808 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:59,808 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:40:59,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:59,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1592368213, now seen corresponding path program 1 times [2018-11-10 11:40:59,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:59,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:59,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:59,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:59,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:59,897 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 11:40:59,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:59,897 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:59,897 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-10 11:40:59,897 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 11:40:59,898 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:59,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:59,903 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:59,918 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:40:59,918 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 11:40:59,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:59,923 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:40:59,962 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 70.82% of their original sizes. [2018-11-10 11:40:59,962 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:41:00,066 INFO L415 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-11-10 11:41:00,066 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:41:00,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:41:00,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-10 11:41:00,067 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:41:00,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 11:41:00,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:41:00,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:41:00,067 INFO L87 Difference]: Start difference. First operand 240 states and 300 transitions. Second operand 11 states. [2018-11-10 11:41:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:00,698 INFO L93 Difference]: Finished difference Result 1010 states and 1287 transitions. [2018-11-10 11:41:00,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:41:00,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-11-10 11:41:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:00,700 INFO L225 Difference]: With dead ends: 1010 [2018-11-10 11:41:00,700 INFO L226 Difference]: Without dead ends: 843 [2018-11-10 11:41:00,701 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:41:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-11-10 11:41:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 245. [2018-11-10 11:41:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-10 11:41:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 307 transitions. [2018-11-10 11:41:00,716 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 307 transitions. Word has length 62 [2018-11-10 11:41:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:00,716 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 307 transitions. [2018-11-10 11:41:00,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 11:41:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 307 transitions. [2018-11-10 11:41:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 11:41:00,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:00,717 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 11:41:00,717 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:00,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1899455193, now seen corresponding path program 1 times [2018-11-10 11:41:00,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:00,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:00,718 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:00,786 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 11:41:00,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:00,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:41:00,786 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-10 11:41:00,786 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 11:41:00,787 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:41:00,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:41:00,792 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:41:02,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:41:02,369 INFO L272 AbstractInterpreter]: Visited 54 different actions 1582 times. Merged at 43 different actions 1260 times. Widened at 2 different actions 38 times. Found 265 fixpoints after 14 different actions. Largest state had 22 variables. [2018-11-10 11:41:02,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:02,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:41:02,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:02,381 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 11:41:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:02,391 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:41:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:02,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:41:02,482 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 11:41:02,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:41:02,535 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 11:41:02,557 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:41:02,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2018-11-10 11:41:02,557 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:41:02,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:41:02,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:41:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:41:02,558 INFO L87 Difference]: Start difference. First operand 245 states and 307 transitions. Second operand 4 states. [2018-11-10 11:41:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:03,236 INFO L93 Difference]: Finished difference Result 484 states and 647 transitions. [2018-11-10 11:41:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:41:03,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-11-10 11:41:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:03,237 INFO L225 Difference]: With dead ends: 484 [2018-11-10 11:41:03,237 INFO L226 Difference]: Without dead ends: 317 [2018-11-10 11:41:03,238 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 11:41:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-11-10 11:41:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2018-11-10 11:41:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-10 11:41:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 359 transitions. [2018-11-10 11:41:03,272 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 359 transitions. Word has length 62 [2018-11-10 11:41:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:03,272 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 359 transitions. [2018-11-10 11:41:03,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:41:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 359 transitions. [2018-11-10 11:41:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 11:41:03,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:03,273 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 11:41:03,273 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:03,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:03,274 INFO L82 PathProgramCache]: Analyzing trace with hash -20052409, now seen corresponding path program 1 times [2018-11-10 11:41:03,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:03,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:03,275 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:03,315 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 11:41:03,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:41:03,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:41:03,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:41:03,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:41:03,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:41:03,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:41:03,316 INFO L87 Difference]: Start difference. First operand 291 states and 359 transitions. Second operand 3 states. [2018-11-10 11:41:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:03,350 INFO L93 Difference]: Finished difference Result 332 states and 406 transitions. [2018-11-10 11:41:03,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:41:03,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-10 11:41:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:03,351 INFO L225 Difference]: With dead ends: 332 [2018-11-10 11:41:03,351 INFO L226 Difference]: Without dead ends: 264 [2018-11-10 11:41:03,351 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 11:41:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-10 11:41:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 235. [2018-11-10 11:41:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-10 11:41:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 290 transitions. [2018-11-10 11:41:03,381 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 290 transitions. Word has length 70 [2018-11-10 11:41:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:03,382 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 290 transitions. [2018-11-10 11:41:03,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:41:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 290 transitions. [2018-11-10 11:41:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 11:41:03,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:03,383 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 11:41:03,383 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:03,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:03,383 INFO L82 PathProgramCache]: Analyzing trace with hash -999116813, now seen corresponding path program 1 times [2018-11-10 11:41:03,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:03,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:03,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:03,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:03,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:03,444 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 11:41:03,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:41:03,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:41:03,444 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:41:03,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:41:03,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:41:03,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:41:03,445 INFO L87 Difference]: Start difference. First operand 235 states and 290 transitions. Second operand 4 states. [2018-11-10 11:41:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:03,611 INFO L93 Difference]: Finished difference Result 534 states and 669 transitions. [2018-11-10 11:41:03,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:41:03,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-11-10 11:41:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:03,613 INFO L225 Difference]: With dead ends: 534 [2018-11-10 11:41:03,613 INFO L226 Difference]: Without dead ends: 377 [2018-11-10 11:41:03,613 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 11:41:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-11-10 11:41:03,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 292. [2018-11-10 11:41:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-10 11:41:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 371 transitions. [2018-11-10 11:41:03,655 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 371 transitions. Word has length 76 [2018-11-10 11:41:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:03,655 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 371 transitions. [2018-11-10 11:41:03,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:41:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 371 transitions. [2018-11-10 11:41:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 11:41:03,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:03,656 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 11:41:03,656 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:03,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2028476111, now seen corresponding path program 2 times [2018-11-10 11:41:03,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:03,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:03,658 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:03,733 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 11:41:03,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:03,734 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:41:03,734 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:41:03,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:41:03,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:03,734 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 11:41:03,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:41:03,746 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:41:03,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 11:41:03,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:41:03,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:41:03,787 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 11:41:03,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:41:03,906 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 11:41:03,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:41:03,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2018-11-10 11:41:03,933 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:41:03,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:41:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:41:03,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:41:03,934 INFO L87 Difference]: Start difference. First operand 292 states and 371 transitions. Second operand 7 states. [2018-11-10 11:41:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:04,745 INFO L93 Difference]: Finished difference Result 985 states and 1273 transitions. [2018-11-10 11:41:04,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 11:41:04,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-11-10 11:41:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:04,748 INFO L225 Difference]: With dead ends: 985 [2018-11-10 11:41:04,748 INFO L226 Difference]: Without dead ends: 738 [2018-11-10 11:41:04,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-11-10 11:41:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-10 11:41:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 544. [2018-11-10 11:41:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-10 11:41:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 676 transitions. [2018-11-10 11:41:04,827 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 676 transitions. Word has length 76 [2018-11-10 11:41:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:04,827 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 676 transitions. [2018-11-10 11:41:04,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:41:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 676 transitions. [2018-11-10 11:41:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 11:41:04,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:04,828 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 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 11:41:04,829 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:04,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1131279850, now seen corresponding path program 1 times [2018-11-10 11:41:04,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:04,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:04,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:41:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:04,830 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 11:41:04,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:41:04,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:41:04,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:41:04,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:41:04,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:41:04,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:41:04,923 INFO L87 Difference]: Start difference. First operand 544 states and 676 transitions. Second operand 6 states. [2018-11-10 11:41:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:05,605 INFO L93 Difference]: Finished difference Result 1527 states and 1967 transitions. [2018-11-10 11:41:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:41:05,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-10 11:41:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:05,608 INFO L225 Difference]: With dead ends: 1527 [2018-11-10 11:41:05,608 INFO L226 Difference]: Without dead ends: 1093 [2018-11-10 11:41:05,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:41:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-11-10 11:41:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1025. [2018-11-10 11:41:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-11-10 11:41:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1296 transitions. [2018-11-10 11:41:05,755 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1296 transitions. Word has length 85 [2018-11-10 11:41:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:05,756 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1296 transitions. [2018-11-10 11:41:05,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:41:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1296 transitions. [2018-11-10 11:41:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 11:41:05,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:05,757 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 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 11:41:05,757 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:05,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1655626830, now seen corresponding path program 1 times [2018-11-10 11:41:05,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:05,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:05,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 11:41:05,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:05,818 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:41:05,818 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-11-10 11:41:05,818 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [85], [95], [99], [101], [103], [105], [115], [118], [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 11:41:05,819 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:41:05,819 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:41:05,827 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:41:08,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:41:08,494 INFO L272 AbstractInterpreter]: Visited 56 different actions 2314 times. Merged at 42 different actions 1667 times. Widened at 2 different actions 50 times. Found 569 fixpoints after 19 different actions. Largest state had 22 variables. [2018-11-10 11:41:08,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:08,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:41:08,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:08,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 11:41:08,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:08,517 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:41:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:08,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:41:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 11:41:08,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:41:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 11:41:09,080 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:41:09,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 11 [2018-11-10 11:41:09,080 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:41:09,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:41:09,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:41:09,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=85, Unknown=1, NotChecked=0, Total=110 [2018-11-10 11:41:09,081 INFO L87 Difference]: Start difference. First operand 1025 states and 1296 transitions. Second operand 5 states. [2018-11-10 11:41:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:14,804 INFO L93 Difference]: Finished difference Result 1946 states and 2451 transitions. [2018-11-10 11:41:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:41:14,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-11-10 11:41:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:14,808 INFO L225 Difference]: With dead ends: 1946 [2018-11-10 11:41:14,808 INFO L226 Difference]: Without dead ends: 1393 [2018-11-10 11:41:14,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2018-11-10 11:41:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-11-10 11:41:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1181. [2018-11-10 11:41:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-11-10 11:41:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1498 transitions. [2018-11-10 11:41:14,968 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1498 transitions. Word has length 85 [2018-11-10 11:41:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:14,968 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 1498 transitions. [2018-11-10 11:41:14,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:41:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1498 transitions. [2018-11-10 11:41:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 11:41:14,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:14,970 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:41:14,970 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:14,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1427970850, now seen corresponding path program 1 times [2018-11-10 11:41:14,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:14,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:14,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 11:41:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:15,026 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:41:15,026 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2018-11-10 11:41:15,027 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [118], [122], [125], [127], [129], [131], [135], [137], [139], [141], [145], [147], [149], [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 11:41:15,030 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:41:15,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:41:15,037 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:41:16,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:41:16,982 INFO L272 AbstractInterpreter]: Visited 59 different actions 2765 times. Merged at 45 different actions 1896 times. Widened at 2 different actions 50 times. Found 785 fixpoints after 21 different actions. Largest state had 22 variables. [2018-11-10 11:41:16,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:16,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:41:16,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:16,987 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 11:41:16,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:16,994 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:41:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:17,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:41:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 28 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:41:17,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:41:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 11:41:17,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:41:17,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2018-11-10 11:41:17,176 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:41:17,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:41:17,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:41:17,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:41:17,177 INFO L87 Difference]: Start difference. First operand 1181 states and 1498 transitions. Second operand 7 states. [2018-11-10 11:41:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:18,452 INFO L93 Difference]: Finished difference Result 3311 states and 4026 transitions. [2018-11-10 11:41:18,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 11:41:18,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-10 11:41:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:18,461 INFO L225 Difference]: With dead ends: 3311 [2018-11-10 11:41:18,461 INFO L226 Difference]: Without dead ends: 3280 [2018-11-10 11:41:18,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-11-10 11:41:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2018-11-10 11:41:18,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 1570. [2018-11-10 11:41:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2018-11-10 11:41:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2116 transitions. [2018-11-10 11:41:18,660 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2116 transitions. Word has length 91 [2018-11-10 11:41:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:18,660 INFO L481 AbstractCegarLoop]: Abstraction has 1570 states and 2116 transitions. [2018-11-10 11:41:18,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:41:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2116 transitions. [2018-11-10 11:41:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 11:41:18,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:18,662 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:41:18,662 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:18,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:18,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1957572388, now seen corresponding path program 1 times [2018-11-10 11:41:18,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:18,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:18,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:18,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:18,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 11:41:18,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:41:18,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 11:41:18,816 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:41:18,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:41:18,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:41:18,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:41:18,817 INFO L87 Difference]: Start difference. First operand 1570 states and 2116 transitions. Second operand 7 states. [2018-11-10 11:41:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:19,600 INFO L93 Difference]: Finished difference Result 3546 states and 4795 transitions. [2018-11-10 11:41:19,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 11:41:19,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-10 11:41:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:19,605 INFO L225 Difference]: With dead ends: 3546 [2018-11-10 11:41:19,605 INFO L226 Difference]: Without dead ends: 2008 [2018-11-10 11:41:19,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:41:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2018-11-10 11:41:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1735. [2018-11-10 11:41:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-11-10 11:41:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2320 transitions. [2018-11-10 11:41:19,836 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2320 transitions. Word has length 91 [2018-11-10 11:41:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:19,837 INFO L481 AbstractCegarLoop]: Abstraction has 1735 states and 2320 transitions. [2018-11-10 11:41:19,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:41:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2320 transitions. [2018-11-10 11:41:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 11:41:19,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:19,839 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 11:41:19,839 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:19,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:19,839 INFO L82 PathProgramCache]: Analyzing trace with hash 531210933, now seen corresponding path program 1 times [2018-11-10 11:41:19,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:19,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:19,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:19,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:19,840 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:19,985 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 11:41:19,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:19,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:41:19,985 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-11-10 11:41:19,985 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 11:41:19,989 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:41:19,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:41:19,995 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:41:22,611 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:41:22,612 INFO L272 AbstractInterpreter]: Visited 58 different actions 3310 times. Merged at 47 different actions 2347 times. Widened at 2 different actions 44 times. Found 872 fixpoints after 24 different actions. Largest state had 22 variables. [2018-11-10 11:41:22,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:22,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:41:22,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:22,613 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 11:41:22,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:22,620 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:41:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:22,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:41:22,679 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 11:41:22,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:41:22,759 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 11:41:22,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:41:22,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2018-11-10 11:41:22,775 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:41:22,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:41:22,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:41:22,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:41:22,776 INFO L87 Difference]: Start difference. First operand 1735 states and 2320 transitions. Second operand 5 states. [2018-11-10 11:41:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:22,991 INFO L93 Difference]: Finished difference Result 2550 states and 3383 transitions. [2018-11-10 11:41:22,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:41:22,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-10 11:41:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:22,994 INFO L225 Difference]: With dead ends: 2550 [2018-11-10 11:41:22,995 INFO L226 Difference]: Without dead ends: 2309 [2018-11-10 11:41:22,996 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 11:41:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-11-10 11:41:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2260. [2018-11-10 11:41:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-11-10 11:41:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3002 transitions. [2018-11-10 11:41:23,193 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3002 transitions. Word has length 94 [2018-11-10 11:41:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:23,193 INFO L481 AbstractCegarLoop]: Abstraction has 2260 states and 3002 transitions. [2018-11-10 11:41:23,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:41:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3002 transitions. [2018-11-10 11:41:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 11:41:23,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:23,196 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 11:41:23,196 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:23,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 790008164, now seen corresponding path program 1 times [2018-11-10 11:41:23,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:23,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:23,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:23,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:23,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 11:41:23,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:23,414 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:41:23,414 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-10 11:41:23,414 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [118], [122], [125], [127], [129], [131], [135], [137], [139], [141], [145], [147], [149], [151], [155], [157], [159], [161], [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 11:41:23,415 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:41:23,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:41:23,420 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:41:25,455 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:41:25,455 INFO L272 AbstractInterpreter]: Visited 61 different actions 2990 times. Merged at 47 different actions 2058 times. Widened at 2 different actions 50 times. Found 835 fixpoints after 22 different actions. Largest state had 22 variables. [2018-11-10 11:41:25,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:25,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:41:25,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:25,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 11:41:25,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:25,464 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:41:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:25,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:41:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 11:41:25,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:41:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 11:41:25,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:41:25,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 18 [2018-11-10 11:41:25,691 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:41:25,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 11:41:25,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 11:41:25,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-11-10 11:41:25,691 INFO L87 Difference]: Start difference. First operand 2260 states and 3002 transitions. Second operand 12 states. [2018-11-10 11:41:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:34,629 INFO L93 Difference]: Finished difference Result 6229 states and 8504 transitions. [2018-11-10 11:41:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 11:41:34,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2018-11-10 11:41:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:34,633 INFO L225 Difference]: With dead ends: 6229 [2018-11-10 11:41:34,633 INFO L226 Difference]: Without dead ends: 4003 [2018-11-10 11:41:34,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2018-11-10 11:41:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4003 states. [2018-11-10 11:41:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4003 to 2911. [2018-11-10 11:41:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2018-11-10 11:41:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 3789 transitions. [2018-11-10 11:41:34,852 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 3789 transitions. Word has length 97 [2018-11-10 11:41:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:34,853 INFO L481 AbstractCegarLoop]: Abstraction has 2911 states and 3789 transitions. [2018-11-10 11:41:34,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 11:41:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 3789 transitions. [2018-11-10 11:41:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 11:41:34,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:34,854 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 11:41:34,854 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:34,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1274084595, now seen corresponding path program 1 times [2018-11-10 11:41:34,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:34,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:34,856 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:35,116 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 11:41:35,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:35,116 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:41:35,116 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-10 11:41:35,116 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 11:41:35,117 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:41:35,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:41:35,124 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:41:37,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:41:37,755 INFO L272 AbstractInterpreter]: Visited 61 different actions 3816 times. Merged at 47 different actions 2712 times. Widened at 2 different actions 50 times. Found 1010 fixpoints after 24 different actions. Largest state had 22 variables. [2018-11-10 11:41:37,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:37,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:41:37,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:37,756 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/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 11:41:37,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:37,763 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:41:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:37,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:41:37,815 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 11:41:37,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:41:37,915 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 11:41:37,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:41:37,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 7] total 18 [2018-11-10 11:41:37,931 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:41:37,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:41:37,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:41:37,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 11:41:37,931 INFO L87 Difference]: Start difference. First operand 2911 states and 3789 transitions. Second operand 6 states. [2018-11-10 11:41:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:41:38,201 INFO L93 Difference]: Finished difference Result 3772 states and 4908 transitions. [2018-11-10 11:41:38,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:41:38,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-11-10 11:41:38,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:41:38,206 INFO L225 Difference]: With dead ends: 3772 [2018-11-10 11:41:38,207 INFO L226 Difference]: Without dead ends: 3515 [2018-11-10 11:41:38,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 11:41:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2018-11-10 11:41:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 2877. [2018-11-10 11:41:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2877 states. [2018-11-10 11:41:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 3754 transitions. [2018-11-10 11:41:38,448 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 3754 transitions. Word has length 97 [2018-11-10 11:41:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:41:38,449 INFO L481 AbstractCegarLoop]: Abstraction has 2877 states and 3754 transitions. [2018-11-10 11:41:38,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:41:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 3754 transitions. [2018-11-10 11:41:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 11:41:38,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:41:38,451 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 11:41:38,451 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:41:38,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:38,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1735884316, now seen corresponding path program 1 times [2018-11-10 11:41:38,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:41:38,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:38,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:38,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:41:38,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:41:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 11:41:38,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:38,583 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:41:38,583 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-11-10 11:41:38,583 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [11], [13], [15], [24], [32], [61], [63], [67], [71], [73], [76], [79], [81], [83], [95], [105], [115], [118], [122], [125], [127], [129], [131], [135], [137], [139], [141], [145], [147], [149], [151], [155], [157], [159], [161], [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 11:41:38,587 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:41:38,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:41:38,592 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:41:40,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:41:40,384 INFO L272 AbstractInterpreter]: Visited 64 different actions 2767 times. Merged at 47 different actions 1900 times. Widened at 2 different actions 46 times. Found 767 fixpoints after 22 different actions. Largest state had 22 variables. [2018-11-10 11:41:40,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:41:40,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:41:40,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:41:40,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:41:40,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:41:40,393 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:41:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:41:40,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:41:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 11:41:40,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:41:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 11:41:40,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:41:40,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 10] total 22 [2018-11-10 11:41:40,905 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:41:40,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 11:41:40,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 11:41:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-11-10 11:41:40,906 INFO L87 Difference]: Start difference. First operand 2877 states and 3754 transitions. Second operand 14 states. [2018-11-10 11:41:56,080 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 11:43:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:43:06,045 INFO L93 Difference]: Finished difference Result 5370 states and 6951 transitions. [2018-11-10 11:43:06,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 11:43:06,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 100 [2018-11-10 11:43:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:43:06,053 INFO L225 Difference]: With dead ends: 5370 [2018-11-10 11:43:06,053 INFO L226 Difference]: Without dead ends: 4883 [2018-11-10 11:43:06,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 187 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=215, Invalid=650, Unknown=5, NotChecked=0, Total=870 [2018-11-10 11:43:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2018-11-10 11:43:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 3414. [2018-11-10 11:43:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3414 states. [2018-11-10 11:43:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 4416 transitions. [2018-11-10 11:43:06,374 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 4416 transitions. Word has length 100 [2018-11-10 11:43:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:43:06,374 INFO L481 AbstractCegarLoop]: Abstraction has 3414 states and 4416 transitions. [2018-11-10 11:43:06,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 11:43:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 4416 transitions. [2018-11-10 11:43:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 11:43:06,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:43:06,376 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 11:43:06,376 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:43:06,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:43:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash 704222458, now seen corresponding path program 1 times [2018-11-10 11:43:06,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:43:06,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:43:06,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:43:06,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:43:06,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:43:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:43:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 11:43:06,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:43:06,599 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:43:06,600 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-11-10 11:43:06,600 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [8], [27], [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 11:43:06,601 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:43:06,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:43:06,606 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:43:08,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:43:08,742 INFO L272 AbstractInterpreter]: Visited 64 different actions 3103 times. Merged at 47 different actions 2195 times. Widened at 2 different actions 40 times. Found 811 fixpoints after 24 different actions. Largest state had 22 variables. [2018-11-10 11:43:08,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:43:08,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:43:08,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:43:08,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:43:08,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:43:08,754 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:43:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:43:08,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:43:08,859 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 11:43:08,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:43:12,949 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 11:43:12,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:43:12,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 17 [2018-11-10 11:43:12,965 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:43:12,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:43:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:43:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:43:12,966 INFO L87 Difference]: Start difference. First operand 3414 states and 4416 transitions. Second operand 7 states. [2018-11-10 11:43:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:43:13,461 INFO L93 Difference]: Finished difference Result 5091 states and 6609 transitions. [2018-11-10 11:43:13,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:43:13,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-11-10 11:43:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:43:13,466 INFO L225 Difference]: With dead ends: 5091 [2018-11-10 11:43:13,466 INFO L226 Difference]: Without dead ends: 4807 [2018-11-10 11:43:13,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 191 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:43:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2018-11-10 11:43:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4049. [2018-11-10 11:43:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2018-11-10 11:43:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 5240 transitions. [2018-11-10 11:43:13,745 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 5240 transitions. Word has length 100 [2018-11-10 11:43:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:43:13,746 INFO L481 AbstractCegarLoop]: Abstraction has 4049 states and 5240 transitions. [2018-11-10 11:43:13,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:43:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 5240 transitions. [2018-11-10 11:43:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 11:43:13,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:43:13,748 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 11:43:13,748 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:43:13,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:43:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1379502856, now seen corresponding path program 1 times [2018-11-10 11:43:13,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:43:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:43:13,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:43:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:43:13,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:43:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:43:14,025 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 11:43:14,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:43:14,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:43:14,025 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-11-10 11:43:14,025 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 11:43:14,026 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:43:14,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:43:14,030 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:43:16,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:43:16,362 INFO L272 AbstractInterpreter]: Visited 64 different actions 3486 times. Merged at 47 different actions 2469 times. Widened at 2 different actions 46 times. Found 920 fixpoints after 24 different actions. Largest state had 22 variables. [2018-11-10 11:43:16,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:43:16,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:43:16,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:43:16,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:43:16,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:43:16,374 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:43:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:43:16,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:43:16,454 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 11:43:16,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:43:16,667 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 11:43:16,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:43:16,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 21 [2018-11-10 11:43:16,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:43:16,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:43:16,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:43:16,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-11-10 11:43:16,684 INFO L87 Difference]: Start difference. First operand 4049 states and 5240 transitions. Second operand 7 states. [2018-11-10 11:43:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:43:17,154 INFO L93 Difference]: Finished difference Result 5505 states and 7120 transitions. [2018-11-10 11:43:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:43:17,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-11-10 11:43:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:43:17,158 INFO L225 Difference]: With dead ends: 5505 [2018-11-10 11:43:17,158 INFO L226 Difference]: Without dead ends: 5253 [2018-11-10 11:43:17,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-11-10 11:43:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2018-11-10 11:43:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4049. [2018-11-10 11:43:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2018-11-10 11:43:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 5240 transitions. [2018-11-10 11:43:17,509 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 5240 transitions. Word has length 100 [2018-11-10 11:43:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:43:17,509 INFO L481 AbstractCegarLoop]: Abstraction has 4049 states and 5240 transitions. [2018-11-10 11:43:17,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:43:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 5240 transitions. [2018-11-10 11:43:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 11:43:17,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:43:17,510 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] [2018-11-10 11:43:17,511 INFO L424 AbstractCegarLoop]: === Iteration 40 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:43:17,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:43:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1840758149, now seen corresponding path program 1 times [2018-11-10 11:43:17,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:43:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:43:17,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:43:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:43:17,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:43:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:43:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 11:43:17,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:43:17,687 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:43:17,687 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2018-11-10 11:43:17,687 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], [131], [135], [137], [139], [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 11:43:17,688 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:43:17,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:43:17,694 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:43:20,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:43:20,443 INFO L272 AbstractInterpreter]: Visited 62 different actions 3989 times. Merged at 51 different actions 2748 times. Widened at 2 different actions 44 times. Found 1146 fixpoints after 28 different actions. Largest state had 22 variables. [2018-11-10 11:43:20,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:43:20,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:43:20,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:43:20,447 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8765dc5f-63cb-43f6-8b36-6576af509485/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:43:20,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:43:20,454 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:43:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:43:20,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:43:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 11:43:20,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:43:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 55 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 11:43:20,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:43:20,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2018-11-10 11:43:20,635 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:43:20,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:43:20,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:43:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:43:20,636 INFO L87 Difference]: Start difference. First operand 4049 states and 5240 transitions. Second operand 5 states. [2018-11-10 11:43:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:43:21,001 INFO L93 Difference]: Finished difference Result 5110 states and 6597 transitions. [2018-11-10 11:43:21,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:43:21,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-11-10 11:43:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:43:21,005 INFO L225 Difference]: With dead ends: 5110 [2018-11-10 11:43:21,005 INFO L226 Difference]: Without dead ends: 4484 [2018-11-10 11:43:21,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:43:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2018-11-10 11:43:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 4448. [2018-11-10 11:43:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4448 states. [2018-11-10 11:43:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4448 states to 4448 states and 5753 transitions. [2018-11-10 11:43:21,314 INFO L78 Accepts]: Start accepts. Automaton has 4448 states and 5753 transitions. Word has length 100 [2018-11-10 11:43:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:43:21,314 INFO L481 AbstractCegarLoop]: Abstraction has 4448 states and 5753 transitions. [2018-11-10 11:43:21,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:43:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4448 states and 5753 transitions. [2018-11-10 11:43:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 11:43:21,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:43:21,316 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, 1, 1] [2018-11-10 11:43:21,316 INFO L424 AbstractCegarLoop]: === Iteration 41 === [mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:43:21,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:43:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1388279840, now seen corresponding path program 1 times [2018-11-10 11:43:21,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:43:21,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:43:21,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:43:21,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:43:21,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:43:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:43:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:43:21,357 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 11:43:21,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:43:21 BoogieIcfgContainer [2018-11-10 11:43:21,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:43:21,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:43:21,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:43:21,403 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:43:21,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:40:44" (3/4) ... [2018-11-10 11:43:21,407 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:43:21,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:43:21,409 INFO L168 Benchmark]: Toolchain (without parser) took 158005.64 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 954.8 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-10 11:43:21,409 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:43:21,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.25 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 941.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:43:21,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.70 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 936.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:43:21,410 INFO L168 Benchmark]: Boogie Preprocessor took 17.33 ms. Allocated memory is still 1.0 GB. Free memory was 936.1 MB in the beginning and 933.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:43:21,410 INFO L168 Benchmark]: RCFGBuilder took 418.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 933.4 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:43:21,410 INFO L168 Benchmark]: TraceAbstraction took 157338.28 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-10 11:43:21,411 INFO L168 Benchmark]: Witness Printer took 3.64 ms. Allocated memory is still 4.5 GB. Free memory is still 3.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:43:21,413 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 209.25 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 941.4 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 15.70 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 936.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.33 ms. Allocated memory is still 1.0 GB. Free memory was 936.1 MB in the beginning and 933.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 418.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 933.4 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 157338.28 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 3.64 ms. Allocated memory is still 4.5 GB. Free memory is still 3.4 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] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL mp_add(a, b) VAL [\old(a)=0, \old(b)=2147483647] [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)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L40] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L41] EXPR na - 1 [L41] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L42] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L43] EXPR na - 1 [L43] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L44] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L45] EXPR na - 1 [L45] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, 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)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=1, r0=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, 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)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=3, na=1, nb=4, partial_sum=0, r0=1, 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)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r1 << 8U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r2 << 16U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r3 << 24U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 38 error locations. UNSAFE Result, 157.2s OverallTime, 41 OverallIterations, 5 TraceHistogramMax, 118.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8226 SDtfs, 12647 SDslu, 24881 SDs, 0 SdLazy, 9676 SolverSat, 557 SolverUnsat, 55 SolverUnknown, 0 SolverNotchecked, 90.8s Time, PredicateUnifierStatistics: 36 DeclaredPredicates, 3229 GetRequests, 2855 SyntacticMatches, 24 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 23.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4448occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 23.1s AbstIntTime, 28 AbstIntIterations, 18 AbstIntStrong, 0.9738289296909998 AbsIntWeakeningRatio, 0.5586206896551724 AbsIntAvgWeakeningVarsNumRemoved, 5.56551724137931 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 21601 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 3701 NumberOfCodeBlocks, 3656 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 4539 ConstructedInterpolants, 591 QuantifiedInterpolants, 2436168 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1994 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 62 InterpolantComputations, 20 PerfectInterpolantSequences, 3196/3584 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...