./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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 64bit --witnessprinter.graph.data.programhash 0455ba49274114922cfe1b7739d9cb0a89e6c868 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 05:44:02,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:44:02,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:44:02,195 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:44:02,196 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:44:02,196 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:44:02,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:44:02,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:44:02,200 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:44:02,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:44:02,202 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:44:02,202 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:44:02,203 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:44:02,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:44:02,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:44:02,206 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:44:02,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:44:02,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:44:02,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:44:02,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:44:02,212 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:44:02,213 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:44:02,215 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:44:02,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:44:02,215 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:44:02,216 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:44:02,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:44:02,219 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:44:02,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:44:02,220 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:44:02,220 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:44:02,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:44:02,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:44:02,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:44:02,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:44:02,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:44:02,224 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-10-27 05:44:02,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:44:02,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:44:02,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:44:02,238 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 05:44:02,239 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 05:44:02,239 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 05:44:02,239 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 05:44:02,239 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 05:44:02,239 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 05:44:02,239 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 05:44:02,240 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 05:44:02,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:44:02,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:44:02,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:44:02,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:44:02,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:44:02,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:44:02,243 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:44:02,243 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:44:02,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:44:02,244 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:44:02,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:44:02,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:44:02,244 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:44:02,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:44:02,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:44:02,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:44:02,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:44:02,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:44:02,245 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 05:44:02,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:44:02,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:44:02,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 05:44:02,246 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_4d71a9ca-6861-4867-8696-908130375a02/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0455ba49274114922cfe1b7739d9cb0a89e6c868 [2018-10-27 05:44:02,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:44:02,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:44:02,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:44:02,293 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:44:02,293 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:44:02,294 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c [2018-10-27 05:44:02,345 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/data/5a4a93a93/237994ef67744a94ad3b6530662ccee3/FLAGf46fe21e5 [2018-10-27 05:44:02,708 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:44:02,709 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c [2018-10-27 05:44:02,717 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/data/5a4a93a93/237994ef67744a94ad3b6530662ccee3/FLAGf46fe21e5 [2018-10-27 05:44:02,731 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/data/5a4a93a93/237994ef67744a94ad3b6530662ccee3 [2018-10-27 05:44:02,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:44:02,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 05:44:02,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:44:02,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:44:02,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:44:02,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4905e68d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02, skipping insertion in model container [2018-10-27 05:44:02,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:44:02,776 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:44:02,911 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:44:02,915 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:44:02,926 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:44:02,938 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:44:02,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02 WrapperNode [2018-10-27 05:44:02,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:44:02,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 05:44:02,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 05:44:02,940 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 05:44:02,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 05:44:02,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:44:02,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:44:02,960 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:44:02,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... [2018-10-27 05:44:02,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:44:02,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:44:02,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:44:02,981 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:44:02,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:44:03,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:44:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:44:03,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:44:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:44:03,109 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:44:03,403 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:44:03,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:44:03 BoogieIcfgContainer [2018-10-27 05:44:03,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:44:03,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:44:03,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:44:03,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:44:03,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:44:02" (1/3) ... [2018-10-27 05:44:03,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b737e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:44:03, skipping insertion in model container [2018-10-27 05:44:03,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:44:02" (2/3) ... [2018-10-27 05:44:03,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b737e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:44:03, skipping insertion in model container [2018-10-27 05:44:03,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:44:03" (3/3) ... [2018-10-27 05:44:03,420 INFO L112 eAbstractionObserver]: Analyzing ICFG GopanReps-CAV2006-Fig1a_true-termination_true-no-overflow.c.c [2018-10-27 05:44:03,435 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:44:03,443 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-27 05:44:03,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-10-27 05:44:03,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:44:03,491 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:44:03,491 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:44:03,491 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:44:03,491 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:44:03,491 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:44:03,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:44:03,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:44:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-27 05:44:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 05:44:03,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:03,515 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:03,518 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:03,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:03,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1241711279, now seen corresponding path program 1 times [2018-10-27 05:44:03,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:03,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:03,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:03,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:03,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:44:03,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:44:03,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:44:03,726 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:44:03,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:44:03,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:44:03,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:44:03,744 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-10-27 05:44:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:03,969 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-10-27 05:44:03,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:44:03,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-27 05:44:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:03,979 INFO L225 Difference]: With dead ends: 43 [2018-10-27 05:44:03,979 INFO L226 Difference]: Without dead ends: 31 [2018-10-27 05:44:03,982 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-10-27 05:44:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-27 05:44:04,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-10-27 05:44:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 05:44:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-10-27 05:44:04,015 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2018-10-27 05:44:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:04,015 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-10-27 05:44:04,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:44:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-10-27 05:44:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-27 05:44:04,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:04,016 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:04,016 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:04,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash -161655964, now seen corresponding path program 1 times [2018-10-27 05:44:04,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:04,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:04,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:04,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:44:04,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:44:04,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:44:04,048 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:44:04,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:44:04,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:44:04,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:44:04,050 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-10-27 05:44:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:04,121 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-10-27 05:44:04,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:44:04,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-27 05:44:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:04,122 INFO L225 Difference]: With dead ends: 36 [2018-10-27 05:44:04,122 INFO L226 Difference]: Without dead ends: 34 [2018-10-27 05:44:04,123 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-10-27 05:44:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-27 05:44:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-10-27 05:44:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-27 05:44:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-10-27 05:44:04,130 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 10 [2018-10-27 05:44:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:04,130 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-10-27 05:44:04,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:44:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-10-27 05:44:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-27 05:44:04,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:04,130 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:04,133 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:04,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:04,134 INFO L82 PathProgramCache]: Analyzing trace with hash -716367528, now seen corresponding path program 1 times [2018-10-27 05:44:04,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:04,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:04,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:04,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:04,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:44:04,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:44:04,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:44:04,176 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:44:04,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:44:04,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:44:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:44:04,177 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-10-27 05:44:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:04,220 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-10-27 05:44:04,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:44:04,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-27 05:44:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:04,221 INFO L225 Difference]: With dead ends: 46 [2018-10-27 05:44:04,221 INFO L226 Difference]: Without dead ends: 25 [2018-10-27 05:44:04,222 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-10-27 05:44:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-27 05:44:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-27 05:44:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 05:44:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-10-27 05:44:04,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 11 [2018-10-27 05:44:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:04,226 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-10-27 05:44:04,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:44:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-10-27 05:44:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 05:44:04,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:04,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:04,227 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:04,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash -732556826, now seen corresponding path program 1 times [2018-10-27 05:44:04,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:04,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:04,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:44:04,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:44:04,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:44:04,275 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:44:04,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:44:04,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:44:04,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:44:04,276 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-10-27 05:44:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:04,315 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-10-27 05:44:04,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:44:04,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-27 05:44:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:04,316 INFO L225 Difference]: With dead ends: 24 [2018-10-27 05:44:04,316 INFO L226 Difference]: Without dead ends: 23 [2018-10-27 05:44:04,317 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-10-27 05:44:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-27 05:44:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 05:44:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 05:44:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-27 05:44:04,320 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 12 [2018-10-27 05:44:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:04,320 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-27 05:44:04,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:44:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-27 05:44:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 05:44:04,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:04,322 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:04,323 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:04,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1247764466, now seen corresponding path program 1 times [2018-10-27 05:44:04,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:04,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:04,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:04,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:04,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:44:04,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:04,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:04,403 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-10-27 05:44:04,405 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [17], [18], [19], [21], [30], [32], [38], [39], [40] [2018-10-27 05:44:04,446 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:44:04,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:44:04,614 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 05:44:04,616 INFO L272 AbstractInterpreter]: Visited 13 different actions 64 times. Merged at 7 different actions 45 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-10-27 05:44:04,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:04,625 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 05:44:04,676 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 50% of their original sizes. [2018-10-27 05:44:04,677 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 05:44:04,880 INFO L415 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-10-27 05:44:04,880 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 05:44:04,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:44:04,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2018-10-27 05:44:04,881 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:44:04,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 05:44:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 05:44:04,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:44:04,882 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-10-27 05:44:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:05,264 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-10-27 05:44:05,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:44:05,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-27 05:44:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:05,265 INFO L225 Difference]: With dead ends: 35 [2018-10-27 05:44:05,265 INFO L226 Difference]: Without dead ends: 32 [2018-10-27 05:44:05,265 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:44:05,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-27 05:44:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-10-27 05:44:05,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 05:44:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-10-27 05:44:05,271 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 16 [2018-10-27 05:44:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:05,271 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-27 05:44:05,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 05:44:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-10-27 05:44:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 05:44:05,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:05,272 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:05,272 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:05,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash -805589903, now seen corresponding path program 1 times [2018-10-27 05:44:05,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:05,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:05,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:05,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:05,274 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:44:05,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:05,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:05,301 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-10-27 05:44:05,301 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [17], [19], [21], [23], [25], [27], [29], [30], [32], [38], [39], [40] [2018-10-27 05:44:05,302 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 05:44:05,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 05:44:05,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 05:44:05,377 INFO L272 AbstractInterpreter]: Visited 16 different actions 125 times. Merged at 10 different actions 85 times. Widened at 1 different actions 8 times. Found 6 fixpoints after 3 different actions. Largest state had 2 variables. [2018-10-27 05:44:05,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:05,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 05:44:05,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:05,416 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:05,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:05,435 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:05,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:44:05,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:44:05,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:05,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-10-27 05:44:05,682 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:05,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 05:44:05,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 05:44:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:44:05,683 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2018-10-27 05:44:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:05,747 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-10-27 05:44:05,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 05:44:05,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-27 05:44:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:05,749 INFO L225 Difference]: With dead ends: 65 [2018-10-27 05:44:05,749 INFO L226 Difference]: Without dead ends: 52 [2018-10-27 05:44:05,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 05:44:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-27 05:44:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-10-27 05:44:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 05:44:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-10-27 05:44:05,756 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 18 [2018-10-27 05:44:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:05,756 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-27 05:44:05,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 05:44:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-10-27 05:44:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 05:44:05,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:05,758 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:05,759 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:05,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1338581941, now seen corresponding path program 1 times [2018-10-27 05:44:05,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:05,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:05,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:05,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 05:44:05,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:44:05,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:44:05,806 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:44:05,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:44:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:44:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:44:05,807 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-10-27 05:44:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:05,856 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-10-27 05:44:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:44:05,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-27 05:44:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:05,858 INFO L225 Difference]: With dead ends: 62 [2018-10-27 05:44:05,858 INFO L226 Difference]: Without dead ends: 42 [2018-10-27 05:44:05,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:44:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-27 05:44:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-27 05:44:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 05:44:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-10-27 05:44:05,862 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2018-10-27 05:44:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:05,863 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-10-27 05:44:05,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:44:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-10-27 05:44:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 05:44:05,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:05,864 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:05,864 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:05,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:05,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1338582133, now seen corresponding path program 1 times [2018-10-27 05:44:05,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:05,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:05,868 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 05:44:05,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:44:05,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 05:44:05,910 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:44:05,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 05:44:05,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 05:44:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:44:05,911 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 4 states. [2018-10-27 05:44:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:05,941 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-10-27 05:44:05,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 05:44:05,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-10-27 05:44:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:05,943 INFO L225 Difference]: With dead ends: 41 [2018-10-27 05:44:05,943 INFO L226 Difference]: Without dead ends: 40 [2018-10-27 05:44:05,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 05:44:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-27 05:44:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-27 05:44:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 05:44:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-10-27 05:44:05,946 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2018-10-27 05:44:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:05,947 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-10-27 05:44:05,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 05:44:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-10-27 05:44:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 05:44:05,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:05,948 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:05,948 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:05,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2112757160, now seen corresponding path program 2 times [2018-10-27 05:44:05,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:05,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:05,952 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 05:44:06,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:06,081 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:06,081 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:06,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:06,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:06,082 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:06,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:06,103 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:06,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 05:44:06,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:06,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:44:06,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:44:06,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:06,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2018-10-27 05:44:06,464 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:06,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:44:06,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:44:06,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:44:06,465 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2018-10-27 05:44:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:06,517 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-10-27 05:44:06,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:44:06,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-10-27 05:44:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:06,520 INFO L225 Difference]: With dead ends: 73 [2018-10-27 05:44:06,520 INFO L226 Difference]: Without dead ends: 62 [2018-10-27 05:44:06,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:44:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-27 05:44:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-27 05:44:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 05:44:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-10-27 05:44:06,527 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 39 [2018-10-27 05:44:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:06,527 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-10-27 05:44:06,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:44:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-10-27 05:44:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 05:44:06,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:06,529 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:06,531 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:06,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:06,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1111076945, now seen corresponding path program 3 times [2018-10-27 05:44:06,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:06,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:06,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:06,533 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 61 proven. 85 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:44:06,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:06,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:06,629 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:06,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:06,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:06,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:06,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:06,636 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:06,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:06,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:06,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 61 proven. 85 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:44:06,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 61 proven. 85 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:44:06,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:06,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-10-27 05:44:06,805 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:06,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 05:44:06,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 05:44:06,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-27 05:44:06,806 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 8 states. [2018-10-27 05:44:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:06,857 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-10-27 05:44:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:44:06,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-10-27 05:44:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:06,858 INFO L225 Difference]: With dead ends: 90 [2018-10-27 05:44:06,858 INFO L226 Difference]: Without dead ends: 72 [2018-10-27 05:44:06,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-27 05:44:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-27 05:44:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-10-27 05:44:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 05:44:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-10-27 05:44:06,867 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 60 [2018-10-27 05:44:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:06,867 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-10-27 05:44:06,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 05:44:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-10-27 05:44:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-27 05:44:06,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:06,869 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:06,869 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:06,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2106211474, now seen corresponding path program 4 times [2018-10-27 05:44:06,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:06,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:06,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:06,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:06,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 111 proven. 67 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 05:44:07,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:07,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:07,050 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:07,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:07,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:07,051 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:07,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:07,058 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:07,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 72 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:44:07,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 72 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 05:44:07,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:07,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2018-10-27 05:44:07,508 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:07,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 05:44:07,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 05:44:07,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-27 05:44:07,510 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2018-10-27 05:44:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:07,757 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-10-27 05:44:07,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 05:44:07,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-10-27 05:44:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:07,759 INFO L225 Difference]: With dead ends: 122 [2018-10-27 05:44:07,759 INFO L226 Difference]: Without dead ends: 104 [2018-10-27 05:44:07,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-27 05:44:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-27 05:44:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-10-27 05:44:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 05:44:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-27 05:44:07,767 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 67 [2018-10-27 05:44:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:07,767 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-27 05:44:07,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 05:44:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-27 05:44:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-27 05:44:07,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:07,769 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 8, 8, 8, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:07,771 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:07,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2076289143, now seen corresponding path program 5 times [2018-10-27 05:44:07,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:07,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:07,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:07,773 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 223 proven. 220 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-27 05:44:07,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:07,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:07,889 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:07,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:07,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:07,890 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:07,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:07,903 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:07,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-27 05:44:07,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:07,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 261 proven. 144 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-27 05:44:08,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 261 proven. 144 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-27 05:44:08,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:08,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2018-10-27 05:44:08,244 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:08,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 05:44:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 05:44:08,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-27 05:44:08,245 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 19 states. [2018-10-27 05:44:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:08,340 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2018-10-27 05:44:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 05:44:08,341 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2018-10-27 05:44:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:08,341 INFO L225 Difference]: With dead ends: 171 [2018-10-27 05:44:08,341 INFO L226 Difference]: Without dead ends: 132 [2018-10-27 05:44:08,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-27 05:44:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-27 05:44:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-27 05:44:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-27 05:44:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-10-27 05:44:08,356 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 102 [2018-10-27 05:44:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:08,356 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-10-27 05:44:08,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 05:44:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-10-27 05:44:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-27 05:44:08,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:08,358 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 10, 10, 10, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:08,358 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:08,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:08,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1896739593, now seen corresponding path program 6 times [2018-10-27 05:44:08,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:08,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:08,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:08,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:08,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 381 proven. 345 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-27 05:44:08,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:08,511 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:08,511 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:08,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:08,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:08,511 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:08,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:08,520 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:08,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:08,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:08,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 381 proven. 345 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-27 05:44:08,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 381 proven. 345 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-27 05:44:09,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:09,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-10-27 05:44:09,192 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:09,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 05:44:09,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 05:44:09,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-27 05:44:09,193 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 13 states. [2018-10-27 05:44:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:09,366 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-10-27 05:44:09,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 05:44:09,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-10-27 05:44:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:09,368 INFO L225 Difference]: With dead ends: 195 [2018-10-27 05:44:09,368 INFO L226 Difference]: Without dead ends: 142 [2018-10-27 05:44:09,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-27 05:44:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-27 05:44:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-10-27 05:44:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-27 05:44:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-10-27 05:44:09,377 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 130 [2018-10-27 05:44:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:09,377 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-10-27 05:44:09,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 05:44:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-10-27 05:44:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-27 05:44:09,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:09,379 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 11, 11, 11, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:09,379 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:09,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:09,379 INFO L82 PathProgramCache]: Analyzing trace with hash 576855160, now seen corresponding path program 7 times [2018-10-27 05:44:09,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:09,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:09,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:09,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:09,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 417 proven. 418 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-27 05:44:09,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:09,560 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:09,560 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:09,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:09,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:09,560 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:09,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:09,568 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:09,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 417 proven. 418 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-27 05:44:09,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 417 proven. 418 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-27 05:44:10,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:10,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-10-27 05:44:10,211 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:10,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 05:44:10,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 05:44:10,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-27 05:44:10,212 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 14 states. [2018-10-27 05:44:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:10,308 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-10-27 05:44:10,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 05:44:10,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 137 [2018-10-27 05:44:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:10,309 INFO L225 Difference]: With dead ends: 202 [2018-10-27 05:44:10,309 INFO L226 Difference]: Without dead ends: 149 [2018-10-27 05:44:10,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-27 05:44:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-27 05:44:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-10-27 05:44:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-27 05:44:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-27 05:44:10,314 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 137 [2018-10-27 05:44:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:10,315 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-27 05:44:10,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 05:44:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-27 05:44:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 05:44:10,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:10,316 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 12, 12, 12, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:10,317 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:10,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1527433687, now seen corresponding path program 8 times [2018-10-27 05:44:10,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:10,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:10,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:10,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:10,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 453 proven. 498 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-27 05:44:10,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:10,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:10,491 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:10,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:10,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:10,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:10,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:10,498 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:10,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-27 05:44:10,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:10,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 527 proven. 247 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-27 05:44:10,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 527 proven. 247 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-27 05:44:11,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2018-10-27 05:44:11,135 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:11,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 05:44:11,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 05:44:11,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 05:44:11,136 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 25 states. [2018-10-27 05:44:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:11,290 INFO L93 Difference]: Finished difference Result 227 states and 232 transitions. [2018-10-27 05:44:11,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 05:44:11,291 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 144 [2018-10-27 05:44:11,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:11,292 INFO L225 Difference]: With dead ends: 227 [2018-10-27 05:44:11,292 INFO L226 Difference]: Without dead ends: 174 [2018-10-27 05:44:11,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 05:44:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-27 05:44:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-27 05:44:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-27 05:44:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-10-27 05:44:11,301 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 144 [2018-10-27 05:44:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:11,302 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-10-27 05:44:11,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-27 05:44:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-10-27 05:44:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 05:44:11,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:11,304 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 14, 14, 14, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:11,305 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:11,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash 889269847, now seen corresponding path program 9 times [2018-10-27 05:44:11,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:11,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:11,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:11,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 671 proven. 679 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-10-27 05:44:11,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:11,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:11,545 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:11,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:11,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:11,546 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:11,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:11,560 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:11,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:11,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:11,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 671 proven. 679 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-10-27 05:44:11,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 671 proven. 679 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-10-27 05:44:11,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:11,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-10-27 05:44:11,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:11,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 05:44:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 05:44:11,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-27 05:44:11,928 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 17 states. [2018-10-27 05:44:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:12,017 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2018-10-27 05:44:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 05:44:12,020 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 172 [2018-10-27 05:44:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:12,021 INFO L225 Difference]: With dead ends: 251 [2018-10-27 05:44:12,021 INFO L226 Difference]: Without dead ends: 184 [2018-10-27 05:44:12,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-27 05:44:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-27 05:44:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-10-27 05:44:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-27 05:44:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-10-27 05:44:12,028 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 172 [2018-10-27 05:44:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:12,029 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-10-27 05:44:12,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 05:44:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-10-27 05:44:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 05:44:12,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:12,033 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 15, 15, 15, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:12,034 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:12,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash -672707432, now seen corresponding path program 10 times [2018-10-27 05:44:12,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:12,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:12,035 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 717 proven. 780 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-10-27 05:44:12,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:12,225 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:12,225 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:12,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:12,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:12,226 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:12,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:12,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:12,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 717 proven. 780 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-10-27 05:44:12,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 717 proven. 780 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-10-27 05:44:12,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:12,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-10-27 05:44:12,715 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:12,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 05:44:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 05:44:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 05:44:12,716 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 18 states. [2018-10-27 05:44:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:12,882 INFO L93 Difference]: Finished difference Result 258 states and 260 transitions. [2018-10-27 05:44:12,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 05:44:12,883 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2018-10-27 05:44:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:12,884 INFO L225 Difference]: With dead ends: 258 [2018-10-27 05:44:12,884 INFO L226 Difference]: Without dead ends: 191 [2018-10-27 05:44:12,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 05:44:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-27 05:44:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2018-10-27 05:44:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-27 05:44:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-27 05:44:12,892 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 179 [2018-10-27 05:44:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:12,893 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-27 05:44:12,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 05:44:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-27 05:44:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-27 05:44:12,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:12,895 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 16, 16, 16, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:12,895 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:12,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:12,895 INFO L82 PathProgramCache]: Analyzing trace with hash 162517815, now seen corresponding path program 11 times [2018-10-27 05:44:12,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:12,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:12,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:12,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:12,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1930 backedges. 763 proven. 888 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-10-27 05:44:13,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:13,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:13,100 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:13,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:13,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:13,101 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/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-10-27 05:44:13,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:13,110 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:13,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-10-27 05:44:13,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:13,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1930 backedges. 873 proven. 378 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2018-10-27 05:44:13,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1930 backedges. 873 proven. 378 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2018-10-27 05:44:14,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:14,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 43 [2018-10-27 05:44:14,798 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:14,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 05:44:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 05:44:14,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-27 05:44:14,799 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 31 states. [2018-10-27 05:44:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:15,020 INFO L93 Difference]: Finished difference Result 283 states and 288 transitions. [2018-10-27 05:44:15,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 05:44:15,021 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 186 [2018-10-27 05:44:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:15,021 INFO L225 Difference]: With dead ends: 283 [2018-10-27 05:44:15,022 INFO L226 Difference]: Without dead ends: 216 [2018-10-27 05:44:15,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-27 05:44:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-27 05:44:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-10-27 05:44:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-27 05:44:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-10-27 05:44:15,029 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 186 [2018-10-27 05:44:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:15,030 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-10-27 05:44:15,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 05:44:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-10-27 05:44:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-27 05:44:15,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:15,031 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 18, 18, 18, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:15,031 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:15,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1240189001, now seen corresponding path program 12 times [2018-10-27 05:44:15,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:15,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:15,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:15,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:15,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2584 backedges. 1041 proven. 1125 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-27 05:44:16,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:16,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:16,045 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:16,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:16,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:16,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:16,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:16,053 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:16,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:16,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:16,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2584 backedges. 1041 proven. 1125 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-27 05:44:16,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2584 backedges. 1041 proven. 1125 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-27 05:44:16,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-10-27 05:44:16,472 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:16,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 05:44:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 05:44:16,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 05:44:16,473 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 21 states. [2018-10-27 05:44:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:16,799 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-10-27 05:44:16,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 05:44:16,800 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 214 [2018-10-27 05:44:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:16,801 INFO L225 Difference]: With dead ends: 307 [2018-10-27 05:44:16,802 INFO L226 Difference]: Without dead ends: 226 [2018-10-27 05:44:16,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 05:44:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-27 05:44:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2018-10-27 05:44:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-27 05:44:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-10-27 05:44:16,811 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 214 [2018-10-27 05:44:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:16,812 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-10-27 05:44:16,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 05:44:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-10-27 05:44:16,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 05:44:16,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:16,814 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 19, 19, 19, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:16,829 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:16,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:16,829 INFO L82 PathProgramCache]: Analyzing trace with hash 974255288, now seen corresponding path program 13 times [2018-10-27 05:44:16,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:16,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:16,830 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2769 backedges. 1097 proven. 1254 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-27 05:44:17,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:17,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:17,249 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:17,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:17,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:17,249 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:17,258 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:17,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2769 backedges. 1097 proven. 1254 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-27 05:44:17,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2769 backedges. 1097 proven. 1254 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-27 05:44:17,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:17,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-10-27 05:44:17,735 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:17,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 05:44:17,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 05:44:17,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 05:44:17,736 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 22 states. [2018-10-27 05:44:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:17,817 INFO L93 Difference]: Finished difference Result 314 states and 316 transitions. [2018-10-27 05:44:17,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 05:44:17,817 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 221 [2018-10-27 05:44:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:17,818 INFO L225 Difference]: With dead ends: 314 [2018-10-27 05:44:17,818 INFO L226 Difference]: Without dead ends: 233 [2018-10-27 05:44:17,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 05:44:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-27 05:44:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2018-10-27 05:44:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-27 05:44:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-10-27 05:44:17,824 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 221 [2018-10-27 05:44:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:17,824 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-10-27 05:44:17,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 05:44:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-10-27 05:44:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-27 05:44:17,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:17,825 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 20, 20, 20, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:17,826 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:17,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1433846935, now seen corresponding path program 14 times [2018-10-27 05:44:17,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:17,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:17,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2961 backedges. 1153 proven. 1390 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-27 05:44:18,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:18,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:18,140 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:18,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:18,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:18,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:18,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:18,147 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:18,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-10-27 05:44:18,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:18,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2961 backedges. 1299 proven. 537 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-27 05:44:18,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2961 backedges. 1299 proven. 537 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-27 05:44:18,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:18,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 15] total 51 [2018-10-27 05:44:18,853 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:18,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-27 05:44:18,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-27 05:44:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-27 05:44:18,854 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 37 states. [2018-10-27 05:44:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:19,045 INFO L93 Difference]: Finished difference Result 339 states and 344 transitions. [2018-10-27 05:44:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 05:44:19,046 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 228 [2018-10-27 05:44:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:19,047 INFO L225 Difference]: With dead ends: 339 [2018-10-27 05:44:19,047 INFO L226 Difference]: Without dead ends: 258 [2018-10-27 05:44:19,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-27 05:44:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-27 05:44:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-10-27 05:44:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-27 05:44:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-10-27 05:44:19,057 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 228 [2018-10-27 05:44:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:19,057 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-10-27 05:44:19,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-27 05:44:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-10-27 05:44:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-27 05:44:19,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:19,058 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 22, 22, 22, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:19,059 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:19,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash 670116119, now seen corresponding path program 15 times [2018-10-27 05:44:19,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:19,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:19,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:19,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:19,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 1491 proven. 1683 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-27 05:44:19,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:19,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:19,452 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:19,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:19,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:19,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:19,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:19,460 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:19,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:19,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:19,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 1491 proven. 1683 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-27 05:44:19,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 1491 proven. 1683 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-27 05:44:20,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:20,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-10-27 05:44:20,047 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:20,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 05:44:20,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 05:44:20,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-27 05:44:20,048 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 25 states. [2018-10-27 05:44:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:20,526 INFO L93 Difference]: Finished difference Result 363 states and 365 transitions. [2018-10-27 05:44:20,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 05:44:20,527 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 256 [2018-10-27 05:44:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:20,528 INFO L225 Difference]: With dead ends: 363 [2018-10-27 05:44:20,528 INFO L226 Difference]: Without dead ends: 268 [2018-10-27 05:44:20,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-27 05:44:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-27 05:44:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2018-10-27 05:44:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-27 05:44:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2018-10-27 05:44:20,538 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 256 [2018-10-27 05:44:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:20,538 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2018-10-27 05:44:20,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-27 05:44:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2018-10-27 05:44:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-27 05:44:20,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:20,539 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 23, 23, 23, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:20,539 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:20,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:20,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1816914728, now seen corresponding path program 16 times [2018-10-27 05:44:20,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:20,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:20,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:20,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:20,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3982 backedges. 1557 proven. 1840 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-27 05:44:21,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:21,389 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:21,389 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:21,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:21,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:21,389 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:21,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:21,399 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:21,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3982 backedges. 1557 proven. 1840 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-27 05:44:21,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3982 backedges. 1557 proven. 1840 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-27 05:44:22,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:22,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2018-10-27 05:44:22,139 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:22,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 05:44:22,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 05:44:22,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 05:44:22,140 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 26 states. [2018-10-27 05:44:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:22,222 INFO L93 Difference]: Finished difference Result 370 states and 372 transitions. [2018-10-27 05:44:22,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 05:44:22,224 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 263 [2018-10-27 05:44:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:22,225 INFO L225 Difference]: With dead ends: 370 [2018-10-27 05:44:22,225 INFO L226 Difference]: Without dead ends: 275 [2018-10-27 05:44:22,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 05:44:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-27 05:44:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-10-27 05:44:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-27 05:44:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-10-27 05:44:22,234 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 263 [2018-10-27 05:44:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:22,234 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-10-27 05:44:22,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 05:44:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-10-27 05:44:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-27 05:44:22,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:22,236 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 24, 24, 24, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:22,236 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:22,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:22,236 INFO L82 PathProgramCache]: Analyzing trace with hash -828006921, now seen corresponding path program 17 times [2018-10-27 05:44:22,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:22,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4212 backedges. 1623 proven. 2004 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-27 05:44:22,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:22,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:22,563 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:22,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:22,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:22,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:22,570 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:22,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-27 05:44:22,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:22,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4212 backedges. 1805 proven. 724 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-27 05:44:23,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4212 backedges. 1805 proven. 724 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-27 05:44:24,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:24,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17, 17] total 59 [2018-10-27 05:44:24,128 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:24,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-27 05:44:24,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-27 05:44:24,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-10-27 05:44:24,129 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 43 states. [2018-10-27 05:44:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:24,327 INFO L93 Difference]: Finished difference Result 395 states and 400 transitions. [2018-10-27 05:44:24,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-27 05:44:24,328 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 270 [2018-10-27 05:44:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:24,329 INFO L225 Difference]: With dead ends: 395 [2018-10-27 05:44:24,329 INFO L226 Difference]: Without dead ends: 300 [2018-10-27 05:44:24,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-10-27 05:44:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-27 05:44:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2018-10-27 05:44:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-27 05:44:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-10-27 05:44:24,342 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 270 [2018-10-27 05:44:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:24,343 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-10-27 05:44:24,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-27 05:44:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-10-27 05:44:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-27 05:44:24,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:24,347 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 26, 26, 26, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:24,348 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:24,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash -488766857, now seen corresponding path program 18 times [2018-10-27 05:44:24,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:24,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:24,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5154 backedges. 2021 proven. 2353 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-10-27 05:44:25,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:25,041 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:25,041 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:25,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:25,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:25,041 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:25,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:25,065 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:25,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:25,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:25,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5154 backedges. 2021 proven. 2353 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-10-27 05:44:25,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5154 backedges. 2021 proven. 2353 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-10-27 05:44:26,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:26,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 53 [2018-10-27 05:44:26,480 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:26,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-27 05:44:26,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 05:44:26,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:26,481 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 29 states. [2018-10-27 05:44:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:26,722 INFO L93 Difference]: Finished difference Result 419 states and 421 transitions. [2018-10-27 05:44:26,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 05:44:26,723 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 298 [2018-10-27 05:44:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:26,725 INFO L225 Difference]: With dead ends: 419 [2018-10-27 05:44:26,725 INFO L226 Difference]: Without dead ends: 310 [2018-10-27 05:44:26,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 570 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-27 05:44:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2018-10-27 05:44:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-27 05:44:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 307 transitions. [2018-10-27 05:44:26,733 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 307 transitions. Word has length 298 [2018-10-27 05:44:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:26,733 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 307 transitions. [2018-10-27 05:44:26,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-27 05:44:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 307 transitions. [2018-10-27 05:44:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-27 05:44:26,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:26,735 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 27, 27, 27, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:26,735 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:26,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:26,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1663020280, now seen corresponding path program 19 times [2018-10-27 05:44:26,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:26,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:26,736 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5415 backedges. 2097 proven. 2538 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-10-27 05:44:27,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:27,591 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:27,591 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:27,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:27,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:27,592 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:27,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:27,600 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:27,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5415 backedges. 2097 proven. 2538 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-10-27 05:44:27,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5415 backedges. 2097 proven. 2538 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-10-27 05:44:28,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:28,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 53 [2018-10-27 05:44:28,490 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:28,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-27 05:44:28,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-27 05:44:28,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:28,491 INFO L87 Difference]: Start difference. First operand 306 states and 307 transitions. Second operand 30 states. [2018-10-27 05:44:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:28,573 INFO L93 Difference]: Finished difference Result 426 states and 428 transitions. [2018-10-27 05:44:28,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-27 05:44:28,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 305 [2018-10-27 05:44:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:28,575 INFO L225 Difference]: With dead ends: 426 [2018-10-27 05:44:28,575 INFO L226 Difference]: Without dead ends: 317 [2018-10-27 05:44:28,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 583 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-27 05:44:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2018-10-27 05:44:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-27 05:44:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-10-27 05:44:28,582 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 305 [2018-10-27 05:44:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:28,583 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-10-27 05:44:28,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-27 05:44:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-10-27 05:44:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-27 05:44:28,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:28,584 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 28, 28, 28, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:28,584 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:28,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash 671244119, now seen corresponding path program 20 times [2018-10-27 05:44:28,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:28,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:28,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:28,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:28,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5683 backedges. 2173 proven. 2730 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-10-27 05:44:28,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:28,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:28,996 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:28,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:28,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:28,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:29,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:29,003 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:29,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-10-27 05:44:29,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:29,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5683 backedges. 2391 proven. 939 refuted. 0 times theorem prover too weak. 2353 trivial. 0 not checked. [2018-10-27 05:44:30,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5683 backedges. 2391 proven. 939 refuted. 0 times theorem prover too weak. 2353 trivial. 0 not checked. [2018-10-27 05:44:31,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:31,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19, 19] total 67 [2018-10-27 05:44:31,312 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:31,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-27 05:44:31,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-27 05:44:31,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-10-27 05:44:31,314 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 49 states. [2018-10-27 05:44:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:31,668 INFO L93 Difference]: Finished difference Result 451 states and 456 transitions. [2018-10-27 05:44:31,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-27 05:44:31,669 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 312 [2018-10-27 05:44:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:31,670 INFO L225 Difference]: With dead ends: 451 [2018-10-27 05:44:31,670 INFO L226 Difference]: Without dead ends: 342 [2018-10-27 05:44:31,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-10-27 05:44:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-27 05:44:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2018-10-27 05:44:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-27 05:44:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2018-10-27 05:44:31,682 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 312 [2018-10-27 05:44:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:31,683 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 342 transitions. [2018-10-27 05:44:31,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-27 05:44:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 342 transitions. [2018-10-27 05:44:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-27 05:44:31,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:31,685 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 30, 30, 30, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:31,685 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:31,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash -509557801, now seen corresponding path program 21 times [2018-10-27 05:44:31,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:31,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:31,686 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6769 backedges. 2631 proven. 3135 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-10-27 05:44:32,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:32,270 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:32,270 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:32,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:32,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:32,270 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:32,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:32,278 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:32,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:32,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:32,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6769 backedges. 2631 proven. 3135 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-10-27 05:44:32,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6769 backedges. 2631 proven. 3135 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-10-27 05:44:33,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:33,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 53 [2018-10-27 05:44:33,164 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:33,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 05:44:33,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 05:44:33,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:33,165 INFO L87 Difference]: Start difference. First operand 341 states and 342 transitions. Second operand 33 states. [2018-10-27 05:44:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:33,247 INFO L93 Difference]: Finished difference Result 475 states and 477 transitions. [2018-10-27 05:44:33,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 05:44:33,248 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 340 [2018-10-27 05:44:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:33,249 INFO L225 Difference]: With dead ends: 475 [2018-10-27 05:44:33,249 INFO L226 Difference]: Without dead ends: 352 [2018-10-27 05:44:33,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 650 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:33,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-27 05:44:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2018-10-27 05:44:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-27 05:44:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 349 transitions. [2018-10-27 05:44:33,259 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 349 transitions. Word has length 340 [2018-10-27 05:44:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:33,260 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 349 transitions. [2018-10-27 05:44:33,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-27 05:44:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 349 transitions. [2018-10-27 05:44:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-27 05:44:33,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:33,262 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 31, 31, 31, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:33,262 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:33,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2049359128, now seen corresponding path program 22 times [2018-10-27 05:44:33,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:33,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:33,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:33,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:33,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7068 backedges. 2717 proven. 3348 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-10-27 05:44:33,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:33,930 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:33,931 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:33,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:33,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:33,931 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:33,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:33,938 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:33,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7068 backedges. 2717 proven. 3348 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-10-27 05:44:34,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7068 backedges. 2717 proven. 3348 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-10-27 05:44:35,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:35,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 53 [2018-10-27 05:44:35,227 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:35,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-27 05:44:35,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-27 05:44:35,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:35,228 INFO L87 Difference]: Start difference. First operand 348 states and 349 transitions. Second operand 34 states. [2018-10-27 05:44:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:35,344 INFO L93 Difference]: Finished difference Result 482 states and 484 transitions. [2018-10-27 05:44:35,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-27 05:44:35,345 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 347 [2018-10-27 05:44:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:35,346 INFO L225 Difference]: With dead ends: 482 [2018-10-27 05:44:35,346 INFO L226 Difference]: Without dead ends: 359 [2018-10-27 05:44:35,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 663 SyntacticMatches, 13 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-27 05:44:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2018-10-27 05:44:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-27 05:44:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-10-27 05:44:35,356 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 347 [2018-10-27 05:44:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:35,356 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-10-27 05:44:35,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-27 05:44:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-10-27 05:44:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-27 05:44:35,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:35,358 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 32, 32, 32, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:35,358 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:35,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:35,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1764554569, now seen corresponding path program 23 times [2018-10-27 05:44:35,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:35,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:35,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:35,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:35,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7374 backedges. 2803 proven. 3568 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-10-27 05:44:35,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:35,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:35,969 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:35,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:35,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:35,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:35,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:35,978 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:36,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-10-27 05:44:36,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:36,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7374 backedges. 2937 proven. 1089 refuted. 0 times theorem prover too weak. 3348 trivial. 0 not checked. [2018-10-27 05:44:36,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7374 backedges. 2937 proven. 1089 refuted. 0 times theorem prover too weak. 3348 trivial. 0 not checked. [2018-10-27 05:44:37,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:37,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 20, 20] total 73 [2018-10-27 05:44:37,274 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:37,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-27 05:44:37,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-27 05:44:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-10-27 05:44:37,276 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 54 states. [2018-10-27 05:44:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:37,469 INFO L93 Difference]: Finished difference Result 500 states and 504 transitions. [2018-10-27 05:44:37,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-27 05:44:37,470 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 354 [2018-10-27 05:44:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:37,471 INFO L225 Difference]: With dead ends: 500 [2018-10-27 05:44:37,471 INFO L226 Difference]: Without dead ends: 377 [2018-10-27 05:44:37,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-10-27 05:44:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-27 05:44:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 376. [2018-10-27 05:44:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-27 05:44:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2018-10-27 05:44:37,480 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 354 [2018-10-27 05:44:37,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:37,480 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2018-10-27 05:44:37,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-27 05:44:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2018-10-27 05:44:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-27 05:44:37,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:37,483 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 34, 34, 34, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:37,483 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:37,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:37,483 INFO L82 PathProgramCache]: Analyzing trace with hash 485362514, now seen corresponding path program 24 times [2018-10-27 05:44:37,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:37,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:37,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:37,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:37,484 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8302 backedges. 3148 proven. 4029 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-27 05:44:38,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:38,357 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:38,357 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:38,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:38,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:38,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:38,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:38,365 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:38,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:38,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:38,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8302 backedges. 3148 proven. 4029 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-27 05:44:38,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8302 backedges. 3148 proven. 4029 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-27 05:44:39,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:39,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 53 [2018-10-27 05:44:39,281 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:39,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-27 05:44:39,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-27 05:44:39,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:39,282 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 37 states. [2018-10-27 05:44:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:39,427 INFO L93 Difference]: Finished difference Result 517 states and 519 transitions. [2018-10-27 05:44:39,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 05:44:39,428 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 375 [2018-10-27 05:44:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:39,430 INFO L225 Difference]: With dead ends: 517 [2018-10-27 05:44:39,430 INFO L226 Difference]: Without dead ends: 387 [2018-10-27 05:44:39,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 716 SyntacticMatches, 19 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-27 05:44:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-10-27 05:44:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-27 05:44:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-10-27 05:44:39,444 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 375 [2018-10-27 05:44:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:39,445 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-10-27 05:44:39,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-27 05:44:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-10-27 05:44:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-27 05:44:39,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:39,447 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 35, 35, 35, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:39,447 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:39,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:39,448 INFO L82 PathProgramCache]: Analyzing trace with hash -802504079, now seen corresponding path program 25 times [2018-10-27 05:44:39,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:39,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:39,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:39,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8634 backedges. 3239 proven. 4270 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-27 05:44:40,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:40,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:40,426 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:40,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:40,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:40,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:40,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:40,435 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:40,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8634 backedges. 3239 proven. 4270 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-27 05:44:40,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8634 backedges. 3239 proven. 4270 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-27 05:44:41,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:41,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 53 [2018-10-27 05:44:41,431 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:41,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-27 05:44:41,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-27 05:44:41,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:41,432 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 38 states. [2018-10-27 05:44:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:41,573 INFO L93 Difference]: Finished difference Result 524 states and 526 transitions. [2018-10-27 05:44:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-27 05:44:41,574 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 382 [2018-10-27 05:44:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:41,576 INFO L225 Difference]: With dead ends: 524 [2018-10-27 05:44:41,576 INFO L226 Difference]: Without dead ends: 394 [2018-10-27 05:44:41,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 729 SyntacticMatches, 21 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-27 05:44:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 390. [2018-10-27 05:44:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-27 05:44:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 391 transitions. [2018-10-27 05:44:41,587 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 391 transitions. Word has length 382 [2018-10-27 05:44:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:41,588 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 391 transitions. [2018-10-27 05:44:41,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-27 05:44:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 391 transitions. [2018-10-27 05:44:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-27 05:44:41,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:41,590 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 36, 36, 36, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:41,590 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:41,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash -859399566, now seen corresponding path program 26 times [2018-10-27 05:44:41,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:41,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:41,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:41,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8973 backedges. 3330 proven. 4518 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-27 05:44:42,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:42,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:42,719 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:42,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:42,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:42,719 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:42,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:42,727 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:42,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-10-27 05:44:42,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:42,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8973 backedges. 3630 proven. 1314 refuted. 0 times theorem prover too weak. 4029 trivial. 0 not checked. [2018-10-27 05:44:43,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8973 backedges. 3630 proven. 1314 refuted. 0 times theorem prover too weak. 4029 trivial. 0 not checked. [2018-10-27 05:44:44,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:44,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 22, 22] total 81 [2018-10-27 05:44:44,360 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:44,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-27 05:44:44,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-27 05:44:44,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-27 05:44:44,361 INFO L87 Difference]: Start difference. First operand 390 states and 391 transitions. Second operand 60 states. [2018-10-27 05:44:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:44,618 INFO L93 Difference]: Finished difference Result 549 states and 554 transitions. [2018-10-27 05:44:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-27 05:44:44,618 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 389 [2018-10-27 05:44:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:44,620 INFO L225 Difference]: With dead ends: 549 [2018-10-27 05:44:44,620 INFO L226 Difference]: Without dead ends: 419 [2018-10-27 05:44:44,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-27 05:44:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-27 05:44:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 418. [2018-10-27 05:44:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-27 05:44:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 419 transitions. [2018-10-27 05:44:44,631 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 419 transitions. Word has length 389 [2018-10-27 05:44:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:44,631 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 419 transitions. [2018-10-27 05:44:44,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-27 05:44:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 419 transitions. [2018-10-27 05:44:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-27 05:44:44,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:44,637 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 38, 38, 38, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:44,637 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:44,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash -296466958, now seen corresponding path program 27 times [2018-10-27 05:44:44,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:44,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:44,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:44,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:44,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10323 backedges. 3898 proven. 5035 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-10-27 05:44:45,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:45,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:45,530 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:45,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:45,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:45,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:45,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:45,545 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:45,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:45,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:45,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10323 backedges. 3898 proven. 5035 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-10-27 05:44:45,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10323 backedges. 3898 proven. 5035 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-10-27 05:44:46,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:46,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 53 [2018-10-27 05:44:46,904 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:46,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-27 05:44:46,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-27 05:44:46,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:46,906 INFO L87 Difference]: Start difference. First operand 418 states and 419 transitions. Second operand 41 states. [2018-10-27 05:44:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:47,028 INFO L93 Difference]: Finished difference Result 573 states and 575 transitions. [2018-10-27 05:44:47,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-27 05:44:47,029 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 417 [2018-10-27 05:44:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:47,030 INFO L225 Difference]: With dead ends: 573 [2018-10-27 05:44:47,030 INFO L226 Difference]: Without dead ends: 429 [2018-10-27 05:44:47,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 796 SyntacticMatches, 27 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-27 05:44:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 425. [2018-10-27 05:44:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-27 05:44:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-10-27 05:44:47,042 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 417 [2018-10-27 05:44:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:47,043 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-10-27 05:44:47,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-27 05:44:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-10-27 05:44:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-27 05:44:47,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:47,046 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 39, 39, 39, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:47,046 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:47,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:47,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1604888145, now seen corresponding path program 28 times [2018-10-27 05:44:47,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:47,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:47,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:47,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:47,047 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10693 backedges. 3999 proven. 5304 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-10-27 05:44:47,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:47,978 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:47,978 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:47,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:47,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:47,978 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:47,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:47,987 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:48,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10693 backedges. 3999 proven. 5304 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-10-27 05:44:48,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10693 backedges. 3999 proven. 5304 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-10-27 05:44:49,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:49,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 53 [2018-10-27 05:44:49,168 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:49,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-27 05:44:49,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-27 05:44:49,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:49,169 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 42 states. [2018-10-27 05:44:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:49,317 INFO L93 Difference]: Finished difference Result 580 states and 582 transitions. [2018-10-27 05:44:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-27 05:44:49,318 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 424 [2018-10-27 05:44:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:49,320 INFO L225 Difference]: With dead ends: 580 [2018-10-27 05:44:49,320 INFO L226 Difference]: Without dead ends: 436 [2018-10-27 05:44:49,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 809 SyntacticMatches, 29 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-27 05:44:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2018-10-27 05:44:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-27 05:44:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2018-10-27 05:44:49,331 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 424 [2018-10-27 05:44:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:49,332 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2018-10-27 05:44:49,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-27 05:44:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2018-10-27 05:44:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-10-27 05:44:49,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:49,339 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 40, 40, 40, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:49,340 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:49,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:49,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2059932398, now seen corresponding path program 29 times [2018-10-27 05:44:49,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:49,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:49,341 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11070 backedges. 4100 proven. 5580 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2018-10-27 05:44:50,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:50,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:50,185 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:50,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:50,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:50,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:50,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:50,194 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:50,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-27 05:44:50,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:50,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11070 backedges. 4436 proven. 1599 refuted. 0 times theorem prover too weak. 5035 trivial. 0 not checked. [2018-10-27 05:44:51,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11070 backedges. 4436 proven. 1599 refuted. 0 times theorem prover too weak. 5035 trivial. 0 not checked. [2018-10-27 05:44:52,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:52,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 24, 24] total 89 [2018-10-27 05:44:52,390 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:52,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-27 05:44:52,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-27 05:44:52,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-10-27 05:44:52,392 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 66 states. [2018-10-27 05:44:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:52,766 INFO L93 Difference]: Finished difference Result 605 states and 610 transitions. [2018-10-27 05:44:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-27 05:44:52,768 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 431 [2018-10-27 05:44:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:52,769 INFO L225 Difference]: With dead ends: 605 [2018-10-27 05:44:52,770 INFO L226 Difference]: Without dead ends: 461 [2018-10-27 05:44:52,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-10-27 05:44:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-27 05:44:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2018-10-27 05:44:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-27 05:44:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 461 transitions. [2018-10-27 05:44:52,784 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 461 transitions. Word has length 431 [2018-10-27 05:44:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:52,784 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 461 transitions. [2018-10-27 05:44:52,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-27 05:44:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 461 transitions. [2018-10-27 05:44:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-27 05:44:52,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:52,792 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 42, 42, 42, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:52,793 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:52,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:52,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1272473454, now seen corresponding path program 30 times [2018-10-27 05:44:52,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:52,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:52,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:52,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:52,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12564 backedges. 4728 proven. 6153 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-27 05:44:54,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:54,580 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:54,580 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:54,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:54,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:54,580 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:54,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:44:54,588 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:44:54,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:44:54,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:54,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12564 backedges. 4728 proven. 6153 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-27 05:44:54,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12564 backedges. 4728 proven. 6153 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-27 05:44:55,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:55,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 53 [2018-10-27 05:44:55,672 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:55,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-27 05:44:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-27 05:44:55,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:55,673 INFO L87 Difference]: Start difference. First operand 460 states and 461 transitions. Second operand 45 states. [2018-10-27 05:44:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:55,828 INFO L93 Difference]: Finished difference Result 629 states and 631 transitions. [2018-10-27 05:44:55,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-27 05:44:55,830 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 459 [2018-10-27 05:44:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:55,831 INFO L225 Difference]: With dead ends: 629 [2018-10-27 05:44:55,831 INFO L226 Difference]: Without dead ends: 471 [2018-10-27 05:44:55,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 876 SyntacticMatches, 35 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-27 05:44:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 467. [2018-10-27 05:44:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-27 05:44:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 468 transitions. [2018-10-27 05:44:55,840 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 468 transitions. Word has length 459 [2018-10-27 05:44:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:55,844 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 468 transitions. [2018-10-27 05:44:55,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-27 05:44:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 468 transitions. [2018-10-27 05:44:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-27 05:44:55,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:55,846 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 43, 43, 43, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:55,847 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:55,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:55,847 INFO L82 PathProgramCache]: Analyzing trace with hash -649326031, now seen corresponding path program 31 times [2018-10-27 05:44:55,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:55,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:55,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:44:55,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:55,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12972 backedges. 4839 proven. 6450 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-27 05:44:56,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:56,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:56,647 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:56,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:56,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:56,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:56,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:56,656 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:44:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:56,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12972 backedges. 4839 proven. 6450 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-27 05:44:56,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:44:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12972 backedges. 4839 proven. 6450 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-27 05:44:57,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:44:57,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 53 [2018-10-27 05:44:57,672 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:44:57,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-27 05:44:57,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-27 05:44:57,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:57,673 INFO L87 Difference]: Start difference. First operand 467 states and 468 transitions. Second operand 46 states. [2018-10-27 05:44:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:44:57,828 INFO L93 Difference]: Finished difference Result 636 states and 638 transitions. [2018-10-27 05:44:57,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-27 05:44:57,829 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 466 [2018-10-27 05:44:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:44:57,831 INFO L225 Difference]: With dead ends: 636 [2018-10-27 05:44:57,831 INFO L226 Difference]: Without dead ends: 478 [2018-10-27 05:44:57,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 889 SyntacticMatches, 37 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:44:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-10-27 05:44:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 474. [2018-10-27 05:44:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-27 05:44:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 475 transitions. [2018-10-27 05:44:57,842 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 475 transitions. Word has length 466 [2018-10-27 05:44:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:44:57,843 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 475 transitions. [2018-10-27 05:44:57,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-27 05:44:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 475 transitions. [2018-10-27 05:44:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-10-27 05:44:57,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:44:57,850 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 44, 44, 44, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-10-27 05:44:57,850 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:44:57,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:44:57,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1454921650, now seen corresponding path program 32 times [2018-10-27 05:44:57,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:44:57,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:57,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:44:57,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:44:57,851 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:44:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:44:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13387 backedges. 4950 proven. 6754 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-27 05:44:58,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:58,964 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:44:58,964 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:44:58,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:44:58,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:44:58,965 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:44:58,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:44:58,972 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:44:59,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-27 05:44:59,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:44:59,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:44:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13387 backedges. 5322 proven. 1912 refuted. 0 times theorem prover too weak. 6153 trivial. 0 not checked. [2018-10-27 05:44:59,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13387 backedges. 5322 proven. 1912 refuted. 0 times theorem prover too weak. 6153 trivial. 0 not checked. [2018-10-27 05:45:01,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:45:01,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 26, 26] total 97 [2018-10-27 05:45:01,435 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:45:01,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-27 05:45:01,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-27 05:45:01,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-10-27 05:45:01,437 INFO L87 Difference]: Start difference. First operand 474 states and 475 transitions. Second operand 72 states. [2018-10-27 05:45:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:01,836 INFO L93 Difference]: Finished difference Result 661 states and 666 transitions. [2018-10-27 05:45:01,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-27 05:45:01,837 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 473 [2018-10-27 05:45:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:01,839 INFO L225 Difference]: With dead ends: 661 [2018-10-27 05:45:01,839 INFO L226 Difference]: Without dead ends: 503 [2018-10-27 05:45:01,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 992 GetRequests, 897 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-10-27 05:45:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-10-27 05:45:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 502. [2018-10-27 05:45:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-10-27 05:45:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 503 transitions. [2018-10-27 05:45:01,855 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 503 transitions. Word has length 473 [2018-10-27 05:45:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:01,855 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 503 transitions. [2018-10-27 05:45:01,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-27 05:45:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 503 transitions. [2018-10-27 05:45:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-10-27 05:45:01,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:01,858 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 46, 46, 46, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:01,858 INFO L424 AbstractCegarLoop]: === Iteration 40 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:01,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1549927218, now seen corresponding path program 33 times [2018-10-27 05:45:01,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:45:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:01,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15025 backedges. 5638 proven. 7383 refuted. 0 times theorem prover too weak. 2004 trivial. 0 not checked. [2018-10-27 05:45:02,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:02,700 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:02,700 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:45:02,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:45:02,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:02,700 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:45:02,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:45:02,711 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:45:02,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:45:02,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:45:02,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:45:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15025 backedges. 5638 proven. 7383 refuted. 0 times theorem prover too weak. 2004 trivial. 0 not checked. [2018-10-27 05:45:02,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15025 backedges. 5638 proven. 7383 refuted. 0 times theorem prover too weak. 2004 trivial. 0 not checked. [2018-10-27 05:45:03,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:45:03,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 53 [2018-10-27 05:45:03,811 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:45:03,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-27 05:45:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-27 05:45:03,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:45:03,812 INFO L87 Difference]: Start difference. First operand 502 states and 503 transitions. Second operand 49 states. [2018-10-27 05:45:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:03,948 INFO L93 Difference]: Finished difference Result 685 states and 687 transitions. [2018-10-27 05:45:03,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-27 05:45:03,949 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 501 [2018-10-27 05:45:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:03,951 INFO L225 Difference]: With dead ends: 685 [2018-10-27 05:45:03,951 INFO L226 Difference]: Without dead ends: 513 [2018-10-27 05:45:03,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1050 GetRequests, 956 SyntacticMatches, 43 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:45:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-27 05:45:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 509. [2018-10-27 05:45:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-10-27 05:45:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 510 transitions. [2018-10-27 05:45:03,961 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 510 transitions. Word has length 501 [2018-10-27 05:45:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:03,961 INFO L481 AbstractCegarLoop]: Abstraction has 509 states and 510 transitions. [2018-10-27 05:45:03,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-27 05:45:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 510 transitions. [2018-10-27 05:45:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-10-27 05:45:03,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:03,964 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 47, 47, 47, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:03,964 INFO L424 AbstractCegarLoop]: === Iteration 41 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:03,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash 629343761, now seen corresponding path program 34 times [2018-10-27 05:45:03,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:03,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:45:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:03,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 5759 proven. 7708 refuted. 0 times theorem prover too weak. 2004 trivial. 0 not checked. [2018-10-27 05:45:04,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:04,858 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:04,858 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:45:04,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:45:04,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:04,858 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:45:04,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:04,868 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:45:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:04,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:45:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 5759 proven. 7708 refuted. 0 times theorem prover too weak. 2004 trivial. 0 not checked. [2018-10-27 05:45:05,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15471 backedges. 5759 proven. 7708 refuted. 0 times theorem prover too weak. 2004 trivial. 0 not checked. [2018-10-27 05:45:06,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:45:06,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 53 [2018-10-27 05:45:06,059 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:45:06,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-27 05:45:06,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-27 05:45:06,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:45:06,060 INFO L87 Difference]: Start difference. First operand 509 states and 510 transitions. Second operand 50 states. [2018-10-27 05:45:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:06,210 INFO L93 Difference]: Finished difference Result 692 states and 694 transitions. [2018-10-27 05:45:06,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-27 05:45:06,211 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 508 [2018-10-27 05:45:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:06,212 INFO L225 Difference]: With dead ends: 692 [2018-10-27 05:45:06,213 INFO L226 Difference]: Without dead ends: 520 [2018-10-27 05:45:06,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1065 GetRequests, 969 SyntacticMatches, 45 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:45:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-27 05:45:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 516. [2018-10-27 05:45:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-10-27 05:45:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 517 transitions. [2018-10-27 05:45:06,225 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 517 transitions. Word has length 508 [2018-10-27 05:45:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:06,225 INFO L481 AbstractCegarLoop]: Abstraction has 516 states and 517 transitions. [2018-10-27 05:45:06,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-27 05:45:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 517 transitions. [2018-10-27 05:45:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-10-27 05:45:06,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:06,229 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 48, 48, 48, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:06,235 INFO L424 AbstractCegarLoop]: === Iteration 42 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:06,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:06,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1153555026, now seen corresponding path program 35 times [2018-10-27 05:45:06,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:06,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:06,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:06,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:06,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 15924 backedges. 5880 proven. 8040 refuted. 0 times theorem prover too weak. 2004 trivial. 0 not checked. [2018-10-27 05:45:07,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:07,274 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:07,274 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:45:07,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:45:07,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:07,274 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:45:07,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:45:07,287 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:45:07,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-10-27 05:45:07,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:45:07,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:45:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15924 backedges. 6288 proven. 2253 refuted. 0 times theorem prover too weak. 7383 trivial. 0 not checked. [2018-10-27 05:45:08,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15924 backedges. 6288 proven. 2253 refuted. 0 times theorem prover too weak. 7383 trivial. 0 not checked. [2018-10-27 05:45:09,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:45:09,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 28, 28] total 105 [2018-10-27 05:45:09,815 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:45:09,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-27 05:45:09,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-27 05:45:09,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-10-27 05:45:09,817 INFO L87 Difference]: Start difference. First operand 516 states and 517 transitions. Second operand 78 states. [2018-10-27 05:45:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:10,260 INFO L93 Difference]: Finished difference Result 717 states and 722 transitions. [2018-10-27 05:45:10,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-27 05:45:10,261 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 515 [2018-10-27 05:45:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:10,263 INFO L225 Difference]: With dead ends: 717 [2018-10-27 05:45:10,263 INFO L226 Difference]: Without dead ends: 545 [2018-10-27 05:45:10,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 977 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-10-27 05:45:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-27 05:45:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 544. [2018-10-27 05:45:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-27 05:45:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2018-10-27 05:45:10,277 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 515 [2018-10-27 05:45:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:10,277 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2018-10-27 05:45:10,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-27 05:45:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2018-10-27 05:45:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-10-27 05:45:10,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:10,286 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 50, 50, 50, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:10,286 INFO L424 AbstractCegarLoop]: === Iteration 43 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:10,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash 578651602, now seen corresponding path program 36 times [2018-10-27 05:45:10,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:10,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:45:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:10,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 17706 backedges. 6628 proven. 8725 refuted. 0 times theorem prover too weak. 2353 trivial. 0 not checked. [2018-10-27 05:45:11,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:11,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:11,286 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:45:11,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:45:11,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:11,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:45:11,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:45:11,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:45:11,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:45:11,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:45:11,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:45:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17706 backedges. 6628 proven. 8725 refuted. 0 times theorem prover too weak. 2353 trivial. 0 not checked. [2018-10-27 05:45:11,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17706 backedges. 6628 proven. 8725 refuted. 0 times theorem prover too weak. 2353 trivial. 0 not checked. [2018-10-27 05:45:12,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:45:12,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-10-27 05:45:12,392 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:45:12,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-27 05:45:12,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-27 05:45:12,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:45:12,393 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 53 states. [2018-10-27 05:45:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:12,568 INFO L93 Difference]: Finished difference Result 737 states and 739 transitions. [2018-10-27 05:45:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-27 05:45:12,569 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 543 [2018-10-27 05:45:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:12,571 INFO L225 Difference]: With dead ends: 737 [2018-10-27 05:45:12,571 INFO L226 Difference]: Without dead ends: 551 [2018-10-27 05:45:12,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1138 GetRequests, 1037 SyntacticMatches, 50 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 05:45:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-10-27 05:45:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2018-10-27 05:45:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-10-27 05:45:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2018-10-27 05:45:12,579 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 543 [2018-10-27 05:45:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:12,579 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2018-10-27 05:45:12,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-27 05:45:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2018-10-27 05:45:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-10-27 05:45:12,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:12,582 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 51, 51, 51, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:12,582 INFO L424 AbstractCegarLoop]: === Iteration 44 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:12,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:12,582 INFO L82 PathProgramCache]: Analyzing trace with hash 691765745, now seen corresponding path program 37 times [2018-10-27 05:45:12,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:12,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:12,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:45:12,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:12,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 7563 proven. 2919 refuted. 0 times theorem prover too weak. 7708 trivial. 0 not checked. [2018-10-27 05:45:13,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:13,090 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:13,090 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:45:13,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:45:13,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:13,091 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:45:13,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:13,102 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 05:45:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:13,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:45:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 231 proven. 17959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:45:14,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 231 proven. 17959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:45:20,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:45:20,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 79, 79] total 157 [2018-10-27 05:45:20,244 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:45:20,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-27 05:45:20,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-27 05:45:20,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-10-27 05:45:20,247 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 80 states. [2018-10-27 05:45:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:21,986 INFO L93 Difference]: Finished difference Result 910 states and 961 transitions. [2018-10-27 05:45:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-27 05:45:21,988 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 550 [2018-10-27 05:45:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:21,990 INFO L225 Difference]: With dead ends: 910 [2018-10-27 05:45:21,990 INFO L226 Difference]: Without dead ends: 909 [2018-10-27 05:45:21,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 975 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-10-27 05:45:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-10-27 05:45:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 908. [2018-10-27 05:45:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-10-27 05:45:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 909 transitions. [2018-10-27 05:45:22,012 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 909 transitions. Word has length 550 [2018-10-27 05:45:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:22,013 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 909 transitions. [2018-10-27 05:45:22,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-27 05:45:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 909 transitions. [2018-10-27 05:45:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2018-10-27 05:45:22,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:22,024 INFO L375 BasicCegarLoop]: trace histogram [129, 129, 128, 128, 78, 78, 78, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:22,024 INFO L424 AbstractCegarLoop]: === Iteration 45 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:22,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1477901464, now seen corresponding path program 38 times [2018-10-27 05:45:22,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:22,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:22,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:45:22,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:22,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 49708 backedges. 34102 proven. 15353 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-27 05:45:23,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:23,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:23,909 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:45:23,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:45:23,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:23,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:45:23,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:45:23,919 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 05:45:24,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 79 check-sat command(s) [2018-10-27 05:45:24,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:45:24,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:45:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 49708 backedges. 34102 proven. 15353 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-27 05:45:24,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 49708 backedges. 34102 proven. 15353 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-27 05:45:29,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 05:45:29,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 105 [2018-10-27 05:45:29,004 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 05:45:29,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-27 05:45:29,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-27 05:45:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-10-27 05:45:29,006 INFO L87 Difference]: Start difference. First operand 908 states and 909 transitions. Second operand 80 states. [2018-10-27 05:45:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:29,779 INFO L93 Difference]: Finished difference Result 1460 states and 1462 transitions. [2018-10-27 05:45:29,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-27 05:45:29,780 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 907 [2018-10-27 05:45:29,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:29,783 INFO L225 Difference]: With dead ends: 1460 [2018-10-27 05:45:29,783 INFO L226 Difference]: Without dead ends: 917 [2018-10-27 05:45:29,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1944 GetRequests, 1761 SyntacticMatches, 80 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10513 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-10-27 05:45:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-10-27 05:45:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 915. [2018-10-27 05:45:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-27 05:45:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 916 transitions. [2018-10-27 05:45:29,806 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 916 transitions. Word has length 907 [2018-10-27 05:45:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:29,807 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 916 transitions. [2018-10-27 05:45:29,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-27 05:45:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 916 transitions. [2018-10-27 05:45:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2018-10-27 05:45:29,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:45:29,816 INFO L375 BasicCegarLoop]: trace histogram [130, 130, 129, 129, 78, 78, 78, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-10-27 05:45:29,816 INFO L424 AbstractCegarLoop]: === Iteration 46 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:45:29,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:45:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1150013897, now seen corresponding path program 39 times [2018-10-27 05:45:29,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 05:45:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:29,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:45:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:45:29,821 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 05:45:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:45:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 50454 backedges. 34230 proven. 15966 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-27 05:45:31,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:31,476 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 05:45:31,476 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 05:45:31,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 05:45:31,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:45:31,476 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:45:31,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:45:31,485 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 05:45:31,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:45:31,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:45:31,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:45:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 50454 backedges. 29355 proven. 0 refuted. 0 times theorem prover too weak. 21099 trivial. 0 not checked. [2018-10-27 05:45:33,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 05:45:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 50454 backedges. 29355 proven. 0 refuted. 0 times theorem prover too weak. 21099 trivial. 0 not checked. [2018-10-27 05:45:36,330 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 05:45:36,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54, 54] imperfect sequences [80] total 132 [2018-10-27 05:45:36,331 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 05:45:36,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-27 05:45:36,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-27 05:45:36,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4590, Invalid=12702, Unknown=0, NotChecked=0, Total=17292 [2018-10-27 05:45:36,332 INFO L87 Difference]: Start difference. First operand 915 states and 916 transitions. Second operand 54 states. [2018-10-27 05:45:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:45:36,636 INFO L93 Difference]: Finished difference Result 915 states and 916 transitions. [2018-10-27 05:45:36,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-27 05:45:36,638 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 914 [2018-10-27 05:45:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:45:36,639 INFO L225 Difference]: With dead ends: 915 [2018-10-27 05:45:36,639 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 05:45:36,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1959 GetRequests, 1777 SyntacticMatches, 52 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11934 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4590, Invalid=12702, Unknown=0, NotChecked=0, Total=17292 [2018-10-27 05:45:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 05:45:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 05:45:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 05:45:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 05:45:36,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 914 [2018-10-27 05:45:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:45:36,642 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 05:45:36,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-27 05:45:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 05:45:36,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 05:45:36,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 05:45:36,928 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 444 DAG size of output: 441 [2018-10-27 05:45:39,794 WARN L179 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 441 DAG size of output: 271 [2018-10-27 05:45:39,798 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 05:45:39,798 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:45:39,798 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:45:39,798 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 05:45:39,798 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 27) no Hoare annotation was computed. [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point L19-2(lines 19 23) no Hoare annotation was computed. [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 27) no Hoare annotation was computed. [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:45:39,799 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 27) the Hoare annotation is: true [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-27 05:45:39,799 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-27 05:45:39,800 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-10-27 05:45:39,800 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-10-27 05:45:39,800 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-10-27 05:45:39,800 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 25) no Hoare annotation was computed. [2018-10-27 05:45:39,801 INFO L421 ceAbstractionStarter]: At program point L18-3(lines 18 25) the Hoare annotation is: (let ((.cse0 (<= 52 main_~x~0))) (or (and (<= main_~y~0 47) (<= main_~x~0 55) .cse0) (and (<= main_~y~0 16) (<= main_~x~0 86) .cse0) (and (<= main_~y~0 35) (<= main_~x~0 67) .cse0) (and (<= main_~y~0 20) .cse0 (<= main_~x~0 82)) (and (<= main_~x~0 76) (<= main_~y~0 26) .cse0) (and (<= main_~x~0 77) (<= main_~y~0 25) .cse0) (and (<= main_~x~0 78) (<= main_~y~0 24) .cse0) (and (<= main_~x~0 53) .cse0 (<= main_~y~0 49)) (and (<= main_~x~0 71) (<= main_~y~0 31) .cse0) (and (<= main_~y~0 21) (<= main_~x~0 81) .cse0) (and (<= main_~x~0 75) (<= main_~y~0 27) .cse0) (and (<= main_~x~0 96) (<= main_~y~0 6) .cse0) (and (<= main_~x~0 87) (<= main_~y~0 15) .cse0) (and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0) (<= main_~y~0 51) (<= 0 (* 2 main_~y~0))) (and (<= main_~x~0 94) (<= main_~y~0 8) .cse0) (and (<= main_~y~0 28) (<= main_~x~0 74) .cse0) (and (<= main_~y~0 18) .cse0 (<= main_~x~0 84)) (and (<= main_~y~0 17) (<= main_~x~0 85) .cse0) (and (<= main_~x~0 99) (<= main_~y~0 3) .cse0) (and (<= main_~y~0 33) (<= main_~x~0 69) .cse0) (and (<= main_~y~0 4) (<= main_~x~0 98) .cse0) (and (<= main_~y~0 29) (<= main_~x~0 73) .cse0) (and (<= main_~y~0 50) (<= main_~x~0 52) .cse0) (and (<= main_~y~0 34) (<= main_~x~0 68) .cse0) (and (<= main_~y~0 9) (<= main_~x~0 93) .cse0) (and (<= main_~x~0 102) .cse0 (<= main_~y~0 0)) (and (<= main_~x~0 80) (<= main_~y~0 22) .cse0) (and (<= (+ main_~y~0 1) 0) .cse0 (<= main_~x~0 103)) (and (<= main_~x~0 54) (<= main_~y~0 48) .cse0) (and (<= main_~x~0 63) (<= main_~y~0 39) .cse0) (and (<= main_~x~0 95) (<= main_~y~0 7) .cse0) (and (<= main_~x~0 64) (<= main_~y~0 38) .cse0) (and (<= main_~x~0 100) (<= main_~y~0 2) .cse0) (and (<= main_~x~0 72) (<= main_~y~0 30) .cse0) (and (<= main_~y~0 43) (<= main_~x~0 59) .cse0) (and (<= main_~y~0 5) (<= main_~x~0 97) .cse0) (and (<= main_~y~0 11) (<= main_~x~0 91) .cse0) (and (<= main_~y~0 13) (<= main_~x~0 89) .cse0) (and (<= main_~x~0 79) (<= main_~y~0 23) .cse0) (and (<= main_~y~0 36) (<= main_~x~0 66) .cse0) (and (<= main_~y~0 1) (<= main_~x~0 101) .cse0) (and (<= main_~y~0 40) (<= main_~x~0 62) .cse0) (and (<= main_~y~0 41) (<= main_~x~0 61) .cse0) (and (<= main_~y~0 37) (<= main_~x~0 65) .cse0) (and (<= main_~y~0 42) (<= main_~x~0 60) .cse0) (and (<= main_~y~0 12) (<= main_~x~0 90) .cse0) (and (<= main_~y~0 45) (<= main_~x~0 57) .cse0) (and (<= main_~x~0 83) (<= main_~y~0 19) .cse0) (and (<= main_~x~0 70) (<= main_~y~0 32) .cse0) (and (<= main_~x~0 56) (<= main_~y~0 46) .cse0) (and (<= main_~x~0 88) (<= main_~y~0 14) .cse0) (and (<= main_~x~0 58) .cse0 (<= main_~y~0 44)) (and (<= main_~y~0 10) (<= main_~x~0 92) .cse0))) [2018-10-27 05:45:39,801 INFO L425 ceAbstractionStarter]: For program point L18-4(lines 18 25) no Hoare annotation was computed. [2018-10-27 05:45:39,813 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-10-27 05:45:39,813 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:45:39,813 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-10-27 05:45:39,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:45:39 BoogieIcfgContainer [2018-10-27 05:45:39,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:45:39,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:45:39,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:45:39,844 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:45:39,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:44:03" (3/4) ... [2018-10-27 05:45:39,851 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 05:45:39,857 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 05:45:39,858 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 05:45:39,862 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-27 05:45:39,862 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-27 05:45:39,862 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:45:39,902 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4d71a9ca-6861-4867-8696-908130375a02/bin-2019/utaipan/witness.graphml [2018-10-27 05:45:39,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:45:39,903 INFO L168 Benchmark]: Toolchain (without parser) took 97168.04 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -147.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-10-27 05:45:39,903 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:45:39,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.55 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-10-27 05:45:39,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.44 ms. Allocated memory is still 1.0 GB. Free memory is still 947.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:45:39,904 INFO L168 Benchmark]: Boogie Preprocessor took 19.83 ms. Allocated memory is still 1.0 GB. Free memory is still 947.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:45:39,904 INFO L168 Benchmark]: RCFGBuilder took 423.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-10-27 05:45:39,904 INFO L168 Benchmark]: TraceAbstraction took 96438.62 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-10-27 05:45:39,905 INFO L168 Benchmark]: Witness Printer took 58.73 ms. Allocated memory is still 2.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:45:39,913 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 202.55 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.44 ms. Allocated memory is still 1.0 GB. Free memory is still 947.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.83 ms. Allocated memory is still 1.0 GB. Free memory is still 947.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 423.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96438.62 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 58.73 ms. Allocated memory is still 2.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((y <= 47 && x <= 55) && 52 <= x) || ((y <= 16 && x <= 86) && 52 <= x)) || ((y <= 35 && x <= 67) && 52 <= x)) || ((y <= 20 && 52 <= x) && x <= 82)) || ((x <= 76 && y <= 26) && 52 <= x)) || ((x <= 77 && y <= 25) && 52 <= x)) || ((x <= 78 && y <= 24) && 52 <= x)) || ((x <= 53 && 52 <= x) && y <= 49)) || ((x <= 71 && y <= 31) && 52 <= x)) || ((y <= 21 && x <= 81) && 52 <= x)) || ((x <= 75 && y <= 27) && 52 <= x)) || ((x <= 96 && y <= 6) && 52 <= x)) || ((x <= 87 && y <= 15) && 52 <= x)) || (((y <= x && x <= y) && y <= 51) && 0 <= 2 * y)) || ((x <= 94 && y <= 8) && 52 <= x)) || ((y <= 28 && x <= 74) && 52 <= x)) || ((y <= 18 && 52 <= x) && x <= 84)) || ((y <= 17 && x <= 85) && 52 <= x)) || ((x <= 99 && y <= 3) && 52 <= x)) || ((y <= 33 && x <= 69) && 52 <= x)) || ((y <= 4 && x <= 98) && 52 <= x)) || ((y <= 29 && x <= 73) && 52 <= x)) || ((y <= 50 && x <= 52) && 52 <= x)) || ((y <= 34 && x <= 68) && 52 <= x)) || ((y <= 9 && x <= 93) && 52 <= x)) || ((x <= 102 && 52 <= x) && y <= 0)) || ((x <= 80 && y <= 22) && 52 <= x)) || ((y + 1 <= 0 && 52 <= x) && x <= 103)) || ((x <= 54 && y <= 48) && 52 <= x)) || ((x <= 63 && y <= 39) && 52 <= x)) || ((x <= 95 && y <= 7) && 52 <= x)) || ((x <= 64 && y <= 38) && 52 <= x)) || ((x <= 100 && y <= 2) && 52 <= x)) || ((x <= 72 && y <= 30) && 52 <= x)) || ((y <= 43 && x <= 59) && 52 <= x)) || ((y <= 5 && x <= 97) && 52 <= x)) || ((y <= 11 && x <= 91) && 52 <= x)) || ((y <= 13 && x <= 89) && 52 <= x)) || ((x <= 79 && y <= 23) && 52 <= x)) || ((y <= 36 && x <= 66) && 52 <= x)) || ((y <= 1 && x <= 101) && 52 <= x)) || ((y <= 40 && x <= 62) && 52 <= x)) || ((y <= 41 && x <= 61) && 52 <= x)) || ((y <= 37 && x <= 65) && 52 <= x)) || ((y <= 42 && x <= 60) && 52 <= x)) || ((y <= 12 && x <= 90) && 52 <= x)) || ((y <= 45 && x <= 57) && 52 <= x)) || ((x <= 83 && y <= 19) && 52 <= x)) || ((x <= 70 && y <= 32) && 52 <= x)) || ((x <= 56 && y <= 46) && 52 <= x)) || ((x <= 88 && y <= 14) && 52 <= x)) || ((x <= 58 && 52 <= x) && y <= 44)) || ((y <= 10 && x <= 92) && 52 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 6 error locations. SAFE Result, 96.3s OverallTime, 46 OverallIterations, 130 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 852 SDtfs, 6800 SDslu, 9559 SDs, 0 SdLazy, 6916 SolverSat, 445 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 27127 GetRequests, 24561 SyntacticMatches, 470 SemanticMatches, 2096 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31054 ImplicationChecksByTransitivity, 66.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=915occurred in iteration=45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.13333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 0.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 46 MinimizatonAttempts, 119 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 109 NumberOfFragments, 542 HoareAnnotationTreeSize, 5 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3193 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 74.6s InterpolantComputationTime, 25924 NumberOfCodeBlocks, 24804 NumberOfCodeBlocksAsserted, 350 NumberOfCheckSat, 38696 ConstructedInterpolants, 0 QuantifiedInterpolants, 41167186 SizeOfPredicates, 38 NumberOfNonLiveVariables, 18689 ConjunctsInSsa, 1150 ConjunctsInUnsatCore, 124 InterpolantComputations, 8 PerfectInterpolantSequences, 655780/1039394 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...