./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.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_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/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 14df269faa4a77275028af94d8141ab36c184cf5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:27:21,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:27:21,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:27:21,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:27:21,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:27:21,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:27:21,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:27:21,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:27:21,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:27:21,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:27:21,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:27:21,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:27:21,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:27:21,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:27:21,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:27:21,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:27:21,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:27:21,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:27:21,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:27:21,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:27:21,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:27:21,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:27:21,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:27:21,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:27:21,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:27:21,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:27:21,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:27:21,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:27:21,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:27:21,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:27:21,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:27:21,349 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:27:21,349 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:27:21,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:27:21,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:27:21,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:27:21,351 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 13:27:21,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:27:21,360 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:27:21,360 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:27:21,360 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:27:21,361 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:27:21,361 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:27:21,361 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:27:21,361 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:27:21,361 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:27:21,361 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:27:21,361 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:27:21,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:27:21,362 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:27:21,362 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:27:21,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:27:21,362 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:27:21,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:27:21,363 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:27:21,363 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 13:27:21,363 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:27:21,363 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:27:21,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:27:21,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:27:21,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:27:21,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:27:21,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:27:21,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:27:21,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:27:21,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:27:21,364 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:27:21,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:27:21,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:27:21,365 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:27:21,365 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_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/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 -> 14df269faa4a77275028af94d8141ab36c184cf5 [2018-11-10 13:27:21,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:27:21,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:27:21,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:27:21,399 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:27:21,399 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:27:21,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 13:27:21,435 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/data/6983aeba1/2e297912191d427b8c6c8731e1bf3e11/FLAGf30e7e49c [2018-11-10 13:27:21,846 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:27:21,847 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/sv-benchmarks/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 13:27:21,853 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/data/6983aeba1/2e297912191d427b8c6c8731e1bf3e11/FLAGf30e7e49c [2018-11-10 13:27:21,866 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/data/6983aeba1/2e297912191d427b8c6c8731e1bf3e11 [2018-11-10 13:27:21,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:27:21,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:27:21,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:27:21,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:27:21,875 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:27:21,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:27:21" (1/1) ... [2018-11-10 13:27:21,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2ee89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:21, skipping insertion in model container [2018-11-10 13:27:21,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:27:21" (1/1) ... [2018-11-10 13:27:21,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:27:21,902 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:27:21,991 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:27:21,993 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:27:22,002 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:27:22,012 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:27:22,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22 WrapperNode [2018-11-10 13:27:22,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:27:22,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:27:22,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:27:22,013 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:27:22,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... [2018-11-10 13:27:22,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... [2018-11-10 13:27:22,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:27:22,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:27:22,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:27:22,030 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:27:22,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... [2018-11-10 13:27:22,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... [2018-11-10 13:27:22,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... [2018-11-10 13:27:22,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... [2018-11-10 13:27:22,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... [2018-11-10 13:27:22,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... [2018-11-10 13:27:22,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... [2018-11-10 13:27:22,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:27:22,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:27:22,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:27:22,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:27:22,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:27:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:27:22,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:27:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-10 13:27:22,130 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-10 13:27:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:27:22,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:27:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:27:22,131 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:27:22,246 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:27:22,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:27:22 BoogieIcfgContainer [2018-11-10 13:27:22,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:27:22,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:27:22,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:27:22,250 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:27:22,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:27:21" (1/3) ... [2018-11-10 13:27:22,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bec609c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:27:22, skipping insertion in model container [2018-11-10 13:27:22,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:27:22" (2/3) ... [2018-11-10 13:27:22,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bec609c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:27:22, skipping insertion in model container [2018-11-10 13:27:22,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:27:22" (3/3) ... [2018-11-10 13:27:22,253 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 13:27:22,259 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:27:22,264 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-10 13:27:22,275 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-10 13:27:22,298 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:27:22,298 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:27:22,298 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:27:22,298 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:27:22,298 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:27:22,298 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:27:22,298 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:27:22,298 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:27:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-10 13:27:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 13:27:22,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:22,315 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:22,317 INFO L424 AbstractCegarLoop]: === Iteration 1 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:22,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash -774276160, now seen corresponding path program 1 times [2018-11-10 13:27:22,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:22,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:22,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:22,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:22,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:22,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:22,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:27:22,449 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:22,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:27:22,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:27:22,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:27:22,467 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-10 13:27:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:22,580 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-10 13:27:22,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:27:22,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-10 13:27:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:22,590 INFO L225 Difference]: With dead ends: 46 [2018-11-10 13:27:22,590 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 13:27:22,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:27:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 13:27:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-10 13:27:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 13:27:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-10 13:27:22,622 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 10 [2018-11-10 13:27:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:22,622 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 13:27:22,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:27:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-10 13:27:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 13:27:22,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:22,623 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:22,623 INFO L424 AbstractCegarLoop]: === Iteration 2 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:22,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:22,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1767242855, now seen corresponding path program 1 times [2018-11-10 13:27:22,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:22,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:22,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:22,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:22,625 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:22,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:22,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:27:22,657 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:22,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:27:22,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:27:22,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:27:22,658 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 5 states. [2018-11-10 13:27:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:22,702 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-11-10 13:27:22,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:27:22,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-10 13:27:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:22,704 INFO L225 Difference]: With dead ends: 54 [2018-11-10 13:27:22,704 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 13:27:22,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:27:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 13:27:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-11-10 13:27:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 13:27:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-10 13:27:22,713 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 11 [2018-11-10 13:27:22,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:22,713 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-10 13:27:22,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:27:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-10 13:27:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 13:27:22,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:22,714 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:22,715 INFO L424 AbstractCegarLoop]: === Iteration 3 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:22,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash -601436741, now seen corresponding path program 1 times [2018-11-10 13:27:22,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:22,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:22,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:27:22,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:22,785 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:22,786 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-10 13:27:22,787 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [8], [9], [22], [26], [30], [34], [35], [36], [38] [2018-11-10 13:27:22,820 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:27:22,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:27:22,911 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:27:22,912 INFO L272 AbstractInterpreter]: Visited 13 different actions 31 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-10 13:27:22,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:22,920 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:27:22,967 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 13:27:22,967 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:27:23,067 INFO L415 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-11-10 13:27:23,067 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:27:23,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:23,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 14 [2018-11-10 13:27:23,068 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:23,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 13:27:23,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 13:27:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:27:23,069 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 10 states. [2018-11-10 13:27:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:23,312 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-10 13:27:23,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:27:23,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-10 13:27:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:23,313 INFO L225 Difference]: With dead ends: 53 [2018-11-10 13:27:23,314 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 13:27:23,314 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:27:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 13:27:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-11-10 13:27:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 13:27:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-10 13:27:23,320 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 16 [2018-11-10 13:27:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:23,320 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-10 13:27:23,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 13:27:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-10 13:27:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 13:27:23,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:23,321 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:23,321 INFO L424 AbstractCegarLoop]: === Iteration 4 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:23,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:23,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1839303495, now seen corresponding path program 1 times [2018-11-10 13:27:23,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:23,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:23,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:23,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:23,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:27:23,336 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:23,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:27:23,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:27:23,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:23,337 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-11-10 13:27:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:23,350 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-10 13:27:23,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:27:23,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-10 13:27:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:23,351 INFO L225 Difference]: With dead ends: 44 [2018-11-10 13:27:23,351 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 13:27:23,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:27:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 13:27:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-10 13:27:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 13:27:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-10 13:27:23,357 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 18 [2018-11-10 13:27:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:23,357 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-10 13:27:23,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:27:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-10 13:27:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 13:27:23,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:23,358 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:23,358 INFO L424 AbstractCegarLoop]: === Iteration 5 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:23,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1183833542, now seen corresponding path program 1 times [2018-11-10 13:27:23,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:23,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:23,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,359 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:23,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:23,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:27:23,387 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:23,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:27:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:27:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:27:23,388 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 4 states. [2018-11-10 13:27:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:23,399 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-10 13:27:23,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:27:23,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-10 13:27:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:23,400 INFO L225 Difference]: With dead ends: 62 [2018-11-10 13:27:23,400 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 13:27:23,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:27:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 13:27:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-11-10 13:27:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 13:27:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-11-10 13:27:23,408 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 19 [2018-11-10 13:27:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:23,408 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-10 13:27:23,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:27:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-11-10 13:27:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 13:27:23,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:23,409 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:23,409 INFO L424 AbstractCegarLoop]: === Iteration 6 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:23,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1671679351, now seen corresponding path program 1 times [2018-11-10 13:27:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:23,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:23,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:27:23,434 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:23,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:27:23,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:27:23,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:27:23,435 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 6 states. [2018-11-10 13:27:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:23,540 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2018-11-10 13:27:23,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:27:23,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-10 13:27:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:23,541 INFO L225 Difference]: With dead ends: 83 [2018-11-10 13:27:23,541 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 13:27:23,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:27:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 13:27:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-11-10 13:27:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 13:27:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-11-10 13:27:23,549 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 23 [2018-11-10 13:27:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:23,549 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-10 13:27:23,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:27:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-10 13:27:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 13:27:23,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:23,550 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:23,550 INFO L424 AbstractCegarLoop]: === Iteration 7 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:23,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:23,551 INFO L82 PathProgramCache]: Analyzing trace with hash -282452290, now seen corresponding path program 1 times [2018-11-10 13:27:23,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:23,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:23,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,552 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:23,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:23,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:27:23,593 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:23,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:27:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:27:23,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:27:23,593 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 6 states. [2018-11-10 13:27:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:23,686 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2018-11-10 13:27:23,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:27:23,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-10 13:27:23,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:23,688 INFO L225 Difference]: With dead ends: 101 [2018-11-10 13:27:23,688 INFO L226 Difference]: Without dead ends: 100 [2018-11-10 13:27:23,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:27:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-10 13:27:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-11-10 13:27:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 13:27:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2018-11-10 13:27:23,702 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 24 [2018-11-10 13:27:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:23,703 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2018-11-10 13:27:23,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:27:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2018-11-10 13:27:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 13:27:23,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:23,705 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:23,705 INFO L424 AbstractCegarLoop]: === Iteration 8 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:23,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1947044292, now seen corresponding path program 2 times [2018-11-10 13:27:23,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:23,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:23,707 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:23,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:23,772 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:23,772 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:23,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:23,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:23,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:23,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:27:23,781 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:27:23,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 13:27:23,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:23,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:23,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:23,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:23,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-10 13:27:23,917 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:23,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:27:23,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:27:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:27:23,918 INFO L87 Difference]: Start difference. First operand 93 states and 117 transitions. Second operand 8 states. [2018-11-10 13:27:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:24,046 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2018-11-10 13:27:24,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 13:27:24,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-10 13:27:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:24,048 INFO L225 Difference]: With dead ends: 121 [2018-11-10 13:27:24,048 INFO L226 Difference]: Without dead ends: 120 [2018-11-10 13:27:24,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-11-10 13:27:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-10 13:27:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2018-11-10 13:27:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 13:27:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2018-11-10 13:27:24,063 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 29 [2018-11-10 13:27:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:24,064 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2018-11-10 13:27:24,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:27:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2018-11-10 13:27:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 13:27:24,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:24,065 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:24,066 INFO L424 AbstractCegarLoop]: === Iteration 9 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:24,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash 634524286, now seen corresponding path program 3 times [2018-11-10 13:27:24,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:24,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:24,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:27:24,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:24,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:24,135 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:24,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:24,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:24,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:24,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:27:24,141 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:27:24,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:27:24,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:24,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:27:24,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:27:24,213 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:24,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 14 [2018-11-10 13:27:24,213 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:24,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:27:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:27:24,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:27:24,213 INFO L87 Difference]: Start difference. First operand 111 states and 140 transitions. Second operand 6 states. [2018-11-10 13:27:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:24,249 INFO L93 Difference]: Finished difference Result 149 states and 192 transitions. [2018-11-10 13:27:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:27:24,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-10 13:27:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:24,251 INFO L225 Difference]: With dead ends: 149 [2018-11-10 13:27:24,251 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 13:27:24,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-11-10 13:27:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 13:27:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-10 13:27:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 13:27:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-11-10 13:27:24,259 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 34 [2018-11-10 13:27:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:24,259 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-10 13:27:24,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:27:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-10 13:27:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 13:27:24,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:24,261 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:24,261 INFO L424 AbstractCegarLoop]: === Iteration 10 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:24,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1824264805, now seen corresponding path program 1 times [2018-11-10 13:27:24,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:24,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:24,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:24,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:24,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:27:24,290 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:24,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:27:24,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:27:24,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:27:24,290 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 5 states. [2018-11-10 13:27:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:24,310 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-10 13:27:24,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:27:24,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-10 13:27:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:24,314 INFO L225 Difference]: With dead ends: 59 [2018-11-10 13:27:24,314 INFO L226 Difference]: Without dead ends: 58 [2018-11-10 13:27:24,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:27:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-10 13:27:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-10 13:27:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 13:27:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-10 13:27:24,320 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 35 [2018-11-10 13:27:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:24,321 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-10 13:27:24,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:27:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-10 13:27:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 13:27:24,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:24,322 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:24,322 INFO L424 AbstractCegarLoop]: === Iteration 11 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:24,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:24,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1185090520, now seen corresponding path program 1 times [2018-11-10 13:27:24,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:24,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:24,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,324 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 13:27:24,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:24,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:27:24,358 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:24,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:27:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:27:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:27:24,359 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 5 states. [2018-11-10 13:27:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:24,426 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-10 13:27:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:27:24,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-10 13:27:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:24,428 INFO L225 Difference]: With dead ends: 58 [2018-11-10 13:27:24,428 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 13:27:24,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:27:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 13:27:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-10 13:27:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 13:27:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-11-10 13:27:24,433 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 49 [2018-11-10 13:27:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:24,433 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-10 13:27:24,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:27:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-10 13:27:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 13:27:24,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:24,434 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:24,435 INFO L424 AbstractCegarLoop]: === Iteration 12 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:24,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1882131073, now seen corresponding path program 1 times [2018-11-10 13:27:24,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,436 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:24,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:27:24,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:27:24,494 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:24,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:27:24,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:27:24,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:27:24,495 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 7 states. [2018-11-10 13:27:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:24,569 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-10 13:27:24,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:27:24,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-11-10 13:27:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:24,570 INFO L225 Difference]: With dead ends: 76 [2018-11-10 13:27:24,570 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 13:27:24,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:27:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 13:27:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-10 13:27:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 13:27:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2018-11-10 13:27:24,576 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 40 [2018-11-10 13:27:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:24,576 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2018-11-10 13:27:24,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:27:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2018-11-10 13:27:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 13:27:24,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:24,578 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:24,578 INFO L424 AbstractCegarLoop]: === Iteration 13 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:24,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1047280733, now seen corresponding path program 2 times [2018-11-10 13:27:24,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:24,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:24,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,582 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:24,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:24,656 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:24,656 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:24,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:24,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:24,657 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:24,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:27:24,662 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:27:24,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 13:27:24,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:24,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:24,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:24,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:24,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-10 13:27:24,804 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:24,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:27:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:27:24,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:27:24,804 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 9 states. [2018-11-10 13:27:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:24,926 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-11-10 13:27:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 13:27:24,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-10 13:27:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:24,927 INFO L225 Difference]: With dead ends: 92 [2018-11-10 13:27:24,927 INFO L226 Difference]: Without dead ends: 91 [2018-11-10 13:27:24,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2018-11-10 13:27:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-10 13:27:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-10 13:27:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 13:27:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-11-10 13:27:24,934 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 45 [2018-11-10 13:27:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:24,935 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-11-10 13:27:24,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:27:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-11-10 13:27:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 13:27:24,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:24,937 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:24,937 INFO L424 AbstractCegarLoop]: === Iteration 14 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:24,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash 483404799, now seen corresponding path program 3 times [2018-11-10 13:27:24,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:24,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:24,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:24,938 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:24,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:24,993 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:24,993 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:24,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:24,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:24,993 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:25,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:27:25,004 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:27:25,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:27:25,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:25,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:25,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:25,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:25,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-10 13:27:25,171 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:25,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:27:25,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:27:25,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-10 13:27:25,172 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 11 states. [2018-11-10 13:27:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:25,347 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2018-11-10 13:27:25,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 13:27:25,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-10 13:27:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:25,349 INFO L225 Difference]: With dead ends: 110 [2018-11-10 13:27:25,349 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 13:27:25,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=334, Invalid=926, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 13:27:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 13:27:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-11-10 13:27:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-10 13:27:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2018-11-10 13:27:25,356 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 50 [2018-11-10 13:27:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:25,356 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2018-11-10 13:27:25,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:27:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2018-11-10 13:27:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 13:27:25,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:25,357 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:25,357 INFO L424 AbstractCegarLoop]: === Iteration 15 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:25,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:25,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2081594659, now seen corresponding path program 4 times [2018-11-10 13:27:25,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:25,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:25,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:25,359 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:25,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:25,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:25,446 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:25,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:25,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:25,447 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:25,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:25,461 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:27:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:25,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:25,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:25,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:25,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-10 13:27:25,692 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:25,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:27:25,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:27:25,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-10 13:27:25,693 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand 13 states. [2018-11-10 13:27:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:25,940 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2018-11-10 13:27:25,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 13:27:25,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-10 13:27:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:25,941 INFO L225 Difference]: With dead ends: 128 [2018-11-10 13:27:25,942 INFO L226 Difference]: Without dead ends: 127 [2018-11-10 13:27:25,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=538, Invalid=1442, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 13:27:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-10 13:27:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-10 13:27:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 13:27:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2018-11-10 13:27:25,950 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 55 [2018-11-10 13:27:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:25,950 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2018-11-10 13:27:25,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:27:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2018-11-10 13:27:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 13:27:25,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:25,953 INFO L375 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:25,954 INFO L424 AbstractCegarLoop]: === Iteration 16 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:25,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:25,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1729970815, now seen corresponding path program 5 times [2018-11-10 13:27:25,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:25,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:26,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:26,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:26,050 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:26,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:26,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:26,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:26,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:27:26,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:27:26,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 13:27:26,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:26,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:26,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:26,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:26,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-10 13:27:26,249 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:26,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 13:27:26,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 13:27:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-11-10 13:27:26,250 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand 15 states. [2018-11-10 13:27:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:26,563 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2018-11-10 13:27:26,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 13:27:26,563 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-11-10 13:27:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:26,563 INFO L225 Difference]: With dead ends: 146 [2018-11-10 13:27:26,564 INFO L226 Difference]: Without dead ends: 145 [2018-11-10 13:27:26,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=792, Invalid=2070, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 13:27:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-10 13:27:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-11-10 13:27:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 13:27:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2018-11-10 13:27:26,572 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 60 [2018-11-10 13:27:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:26,573 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2018-11-10 13:27:26,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 13:27:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2018-11-10 13:27:26,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 13:27:26,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:26,574 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:26,574 INFO L424 AbstractCegarLoop]: === Iteration 17 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:26,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:26,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1014819619, now seen corresponding path program 6 times [2018-11-10 13:27:26,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:26,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:26,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 148 proven. 70 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:26,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:26,689 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:26,689 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:26,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:26,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:26,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:26,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:27:26,700 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:27:26,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:27:26,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:26,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 148 proven. 70 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:26,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 148 proven. 70 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:26,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:26,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-10 13:27:26,902 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:26,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 13:27:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 13:27:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2018-11-10 13:27:26,903 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 17 states. [2018-11-10 13:27:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:27,248 INFO L93 Difference]: Finished difference Result 164 states and 189 transitions. [2018-11-10 13:27:27,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 13:27:27,248 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-11-10 13:27:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:27,249 INFO L225 Difference]: With dead ends: 164 [2018-11-10 13:27:27,249 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 13:27:27,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1096, Invalid=2810, Unknown=0, NotChecked=0, Total=3906 [2018-11-10 13:27:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 13:27:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-11-10 13:27:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-10 13:27:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2018-11-10 13:27:27,256 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 75 [2018-11-10 13:27:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:27,257 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2018-11-10 13:27:27,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 13:27:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2018-11-10 13:27:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 13:27:27,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:27,257 INFO L375 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:27,257 INFO L424 AbstractCegarLoop]: === Iteration 18 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:27,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:27,258 INFO L82 PathProgramCache]: Analyzing trace with hash 249575679, now seen corresponding path program 7 times [2018-11-10 13:27:27,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:27,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:27,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:27,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:27,258 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 99 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:27,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:27,383 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:27,383 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:27,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:27,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:27,383 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:27,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:27,390 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:27:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:27,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 99 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:27,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 99 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:27,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:27,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-10 13:27:27,674 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:27,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 13:27:27,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 13:27:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 13:27:27,675 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 19 states. [2018-11-10 13:27:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:28,148 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2018-11-10 13:27:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-10 13:27:28,149 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-11-10 13:27:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:28,150 INFO L225 Difference]: With dead ends: 182 [2018-11-10 13:27:28,150 INFO L226 Difference]: Without dead ends: 181 [2018-11-10 13:27:28,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1450, Invalid=3662, Unknown=0, NotChecked=0, Total=5112 [2018-11-10 13:27:28,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-10 13:27:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-11-10 13:27:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-10 13:27:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2018-11-10 13:27:28,158 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 70 [2018-11-10 13:27:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:28,158 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2018-11-10 13:27:28,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 13:27:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2018-11-10 13:27:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 13:27:28,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:28,159 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:28,160 INFO L424 AbstractCegarLoop]: === Iteration 19 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:28,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2096975837, now seen corresponding path program 8 times [2018-11-10 13:27:28,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:28,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:28,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:28,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:28,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 118 proven. 133 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:28,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:28,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:28,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:28,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:28,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:28,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:28,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:27:28,313 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:27:28,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-10 13:27:28,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:28,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 118 proven. 133 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:28,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 118 proven. 133 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:28,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:28,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-10 13:27:28,674 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:28,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 13:27:28,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 13:27:28,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 13:27:28,675 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand 21 states. [2018-11-10 13:27:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:29,270 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2018-11-10 13:27:29,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-10 13:27:29,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 75 [2018-11-10 13:27:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:29,272 INFO L225 Difference]: With dead ends: 200 [2018-11-10 13:27:29,272 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 13:27:29,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1854, Invalid=4626, Unknown=0, NotChecked=0, Total=6480 [2018-11-10 13:27:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 13:27:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-10 13:27:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-10 13:27:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2018-11-10 13:27:29,280 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 75 [2018-11-10 13:27:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:29,280 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2018-11-10 13:27:29,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 13:27:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2018-11-10 13:27:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 13:27:29,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:29,281 INFO L375 BasicCegarLoop]: trace histogram [15, 13, 13, 12, 12, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:29,281 INFO L424 AbstractCegarLoop]: === Iteration 20 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:29,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1630524673, now seen corresponding path program 9 times [2018-11-10 13:27:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:29,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:29,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:29,282 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 220 proven. 172 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:29,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:29,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:29,482 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:29,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:29,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:29,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:29,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:27:29,488 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:27:29,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:27:29,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:29,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 220 proven. 172 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:29,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 220 proven. 172 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:29,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:29,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-10 13:27:29,786 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:29,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 13:27:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 13:27:29,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1498, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 13:27:29,787 INFO L87 Difference]: Start difference. First operand 199 states and 230 transitions. Second operand 23 states. [2018-11-10 13:27:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:30,337 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2018-11-10 13:27:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-10 13:27:30,337 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2018-11-10 13:27:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:30,338 INFO L225 Difference]: With dead ends: 218 [2018-11-10 13:27:30,338 INFO L226 Difference]: Without dead ends: 217 [2018-11-10 13:27:30,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2308, Invalid=5702, Unknown=0, NotChecked=0, Total=8010 [2018-11-10 13:27:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-10 13:27:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-11-10 13:27:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 13:27:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 251 transitions. [2018-11-10 13:27:30,347 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 251 transitions. Word has length 90 [2018-11-10 13:27:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:30,348 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 251 transitions. [2018-11-10 13:27:30,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 13:27:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2018-11-10 13:27:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 13:27:30,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:30,349 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:30,349 INFO L424 AbstractCegarLoop]: === Iteration 21 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:30,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash 321120675, now seen corresponding path program 10 times [2018-11-10 13:27:30,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:30,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:30,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:30,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:30,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 146 proven. 216 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:30,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:30,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:30,531 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:30,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:30,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:30,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:27:30,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:30,537 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:27:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:30,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 146 proven. 216 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:30,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 146 proven. 216 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:30,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:30,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-11-10 13:27:30,935 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:30,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 13:27:30,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 13:27:30,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=1780, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 13:27:30,937 INFO L87 Difference]: Start difference. First operand 217 states and 251 transitions. Second operand 25 states. [2018-11-10 13:27:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:31,571 INFO L93 Difference]: Finished difference Result 236 states and 273 transitions. [2018-11-10 13:27:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-10 13:27:31,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-11-10 13:27:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:31,572 INFO L225 Difference]: With dead ends: 236 [2018-11-10 13:27:31,572 INFO L226 Difference]: Without dead ends: 235 [2018-11-10 13:27:31,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2812, Invalid=6890, Unknown=0, NotChecked=0, Total=9702 [2018-11-10 13:27:31,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-10 13:27:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-11-10 13:27:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-10 13:27:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 272 transitions. [2018-11-10 13:27:31,584 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 272 transitions. Word has length 85 [2018-11-10 13:27:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:31,584 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 272 transitions. [2018-11-10 13:27:31,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 13:27:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 272 transitions. [2018-11-10 13:27:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 13:27:31,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:31,586 INFO L375 BasicCegarLoop]: trace histogram [17, 15, 15, 14, 14, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:31,586 INFO L424 AbstractCegarLoop]: === Iteration 22 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:31,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:31,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2073394817, now seen corresponding path program 11 times [2018-11-10 13:27:31,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:31,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:31,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:31,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:31,587 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 268 proven. 265 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:31,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:31,771 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:31,771 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:31,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:31,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:31,771 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/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-11-10 13:27:31,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:27:31,778 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:27:31,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-10 13:27:31,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:31,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 268 proven. 265 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:31,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 268 proven. 265 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:32,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:32,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-10 13:27:32,170 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:32,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 13:27:32,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 13:27:32,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=2086, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 13:27:32,171 INFO L87 Difference]: Start difference. First operand 235 states and 272 transitions. Second operand 27 states. [2018-11-10 13:27:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:32,868 INFO L93 Difference]: Finished difference Result 254 states and 294 transitions. [2018-11-10 13:27:32,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-10 13:27:32,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-11-10 13:27:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:32,870 INFO L225 Difference]: With dead ends: 254 [2018-11-10 13:27:32,870 INFO L226 Difference]: Without dead ends: 253 [2018-11-10 13:27:32,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2322 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3366, Invalid=8190, Unknown=0, NotChecked=0, Total=11556 [2018-11-10 13:27:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-10 13:27:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-11-10 13:27:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 13:27:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 293 transitions. [2018-11-10 13:27:32,885 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 293 transitions. Word has length 100 [2018-11-10 13:27:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:32,885 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 293 transitions. [2018-11-10 13:27:32,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 13:27:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 293 transitions. [2018-11-10 13:27:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 13:27:32,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:32,886 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 16, 15, 15, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:32,886 INFO L424 AbstractCegarLoop]: === Iteration 23 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:32,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:32,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1424902237, now seen corresponding path program 12 times [2018-11-10 13:27:32,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:32,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:32,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:32,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:32,888 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 292 proven. 319 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:33,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:33,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:33,159 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:33,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:33,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:33,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/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-11-10 13:27:33,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:27:33,166 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:27:33,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:27:33,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:33,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 292 proven. 319 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:33,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 292 proven. 319 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 13:27:33,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:33,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-10 13:27:33,606 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:33,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-10 13:27:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 13:27:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2416, Unknown=0, NotChecked=0, Total=3080 [2018-11-10 13:27:33,608 INFO L87 Difference]: Start difference. First operand 253 states and 293 transitions. Second operand 29 states. [2018-11-10 13:27:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:34,455 INFO L93 Difference]: Finished difference Result 272 states and 315 transitions. [2018-11-10 13:27:34,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-10 13:27:34,456 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 105 [2018-11-10 13:27:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:34,457 INFO L225 Difference]: With dead ends: 272 [2018-11-10 13:27:34,457 INFO L226 Difference]: Without dead ends: 271 [2018-11-10 13:27:34,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2757 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3970, Invalid=9602, Unknown=0, NotChecked=0, Total=13572 [2018-11-10 13:27:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-10 13:27:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-11-10 13:27:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 13:27:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 314 transitions. [2018-11-10 13:27:34,465 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 314 transitions. Word has length 105 [2018-11-10 13:27:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:34,465 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 314 transitions. [2018-11-10 13:27:34,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-10 13:27:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 314 transitions. [2018-11-10 13:27:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 13:27:34,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:34,466 INFO L375 BasicCegarLoop]: trace histogram [17, 15, 15, 14, 14, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:34,467 INFO L424 AbstractCegarLoop]: === Iteration 24 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:34,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:34,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1786535039, now seen corresponding path program 13 times [2018-11-10 13:27:34,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:34,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:34,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:27:34,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:34,468 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 188 proven. 378 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:34,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:34,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:34,721 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:34,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:34,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:34,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/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-11-10 13:27:34,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:34,730 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:27:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:34,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 188 proven. 378 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:34,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 188 proven. 378 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:35,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:27:35,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-11-10 13:27:35,264 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:27:35,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 13:27:35,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 13:27:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=2770, Unknown=0, NotChecked=0, Total=3540 [2018-11-10 13:27:35,265 INFO L87 Difference]: Start difference. First operand 271 states and 314 transitions. Second operand 31 states. [2018-11-10 13:27:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:36,175 INFO L93 Difference]: Finished difference Result 290 states and 336 transitions. [2018-11-10 13:27:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-11-10 13:27:36,175 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 100 [2018-11-10 13:27:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:36,176 INFO L225 Difference]: With dead ends: 290 [2018-11-10 13:27:36,176 INFO L226 Difference]: Without dead ends: 289 [2018-11-10 13:27:36,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3229 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4624, Invalid=11126, Unknown=0, NotChecked=0, Total=15750 [2018-11-10 13:27:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-10 13:27:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-11-10 13:27:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-10 13:27:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 335 transitions. [2018-11-10 13:27:36,186 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 335 transitions. Word has length 100 [2018-11-10 13:27:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:36,186 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 335 transitions. [2018-11-10 13:27:36,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 13:27:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 335 transitions. [2018-11-10 13:27:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 13:27:36,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:27:36,188 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 16, 15, 15, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:27:36,188 INFO L424 AbstractCegarLoop]: === Iteration 25 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 13:27:36,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:27:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1661944669, now seen corresponding path program 14 times [2018-11-10 13:27:36,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:27:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:36,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:27:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:27:36,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:27:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:27:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 202 proven. 442 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:27:36,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:36,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:27:36,452 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:27:36,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:27:36,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:27:36,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/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-11-10 13:27:36,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:27:36,458 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:27:36,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-10 13:27:36,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:27:36,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:27:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-11-10 13:27:36,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:27:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-11-10 13:27:36,560 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:27:36,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [32] total 38 [2018-11-10 13:27:36,560 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:27:36,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:27:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:27:36,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1120, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 13:27:36,561 INFO L87 Difference]: Start difference. First operand 289 states and 335 transitions. Second operand 7 states. [2018-11-10 13:27:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:27:36,598 INFO L93 Difference]: Finished difference Result 308 states and 356 transitions. [2018-11-10 13:27:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:27:36,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2018-11-10 13:27:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:27:36,600 INFO L225 Difference]: With dead ends: 308 [2018-11-10 13:27:36,600 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:27:36,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=379, Invalid=1343, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 13:27:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:27:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:27:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:27:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:27:36,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-11-10 13:27:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:27:36,602 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:27:36,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:27:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:27:36,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:27:36,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:27:36,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:27:36,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:27:36,796 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 13:27:36,796 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:27:36,796 INFO L425 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2018-11-10 13:27:36,797 INFO L425 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,797 INFO L425 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,797 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,797 INFO L425 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,797 INFO L421 ceAbstractionStarter]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse2 (* 2 |g_#in~x|))) (let ((.cse0 (* 2 g_~x)) (.cse1 (< .cse2 0))) (and (or (and (<= .cse0 4294967294) (<= 2 .cse0)) .cse1 (< 2147483647 |g_#in~x|)) (or (< 4294967292 .cse2) (<= .cse0 4294967292) .cse1) (not (= |g_#in~x| 0))))) [2018-11-10 13:27:36,797 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. [2018-11-10 13:27:36,797 INFO L425 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,797 INFO L425 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,797 INFO L425 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,797 INFO L425 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,798 INFO L421 ceAbstractionStarter]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse2 (* 2 |g_#in~x|))) (let ((.cse1 (* 2 g_~x)) (.cse0 (< .cse2 0))) (and (or .cse0 (and (= 1 |g_#t~ret0|) (<= .cse1 4294967294) (<= 2 .cse1)) (< 2147483647 |g_#in~x|)) (or (< 4294967292 .cse2) (<= .cse1 4294967292) .cse0) (not (= |g_#in~x| 0))))) [2018-11-10 13:27:36,798 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2018-11-10 13:27:36,798 INFO L425 ceAbstractionStarter]: For program point L15-7(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,798 INFO L428 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2018-11-10 13:27:36,798 INFO L425 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 13:27:36,798 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:27:36,798 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:27:36,798 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:27:36,798 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:27:36,798 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 18 22) the Hoare annotation is: true [2018-11-10 13:27:36,798 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 18 22) no Hoare annotation was computed. [2018-11-10 13:27:36,798 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 18 22) no Hoare annotation was computed. [2018-11-10 13:27:36,798 INFO L421 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (<= (* 2 main_~x~0) 4294967294) (<= 0 main_~x~0)) [2018-11-10 13:27:36,798 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 13:27:36,798 INFO L425 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-11-10 13:27:36,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:27:36 BoogieIcfgContainer [2018-11-10 13:27:36,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:27:36,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:27:36,801 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:27:36,801 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:27:36,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:27:22" (3/4) ... [2018-11-10 13:27:36,805 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:27:36,809 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:27:36,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-10 13:27:36,810 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:27:36,813 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 13:27:36,813 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 13:27:36,814 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 13:27:36,844 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7b3e2f08-b64d-45e8-95e5-a0002b8c421b/bin-2019/utaipan/witness.graphml [2018-11-10 13:27:36,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:27:36,845 INFO L168 Benchmark]: Toolchain (without parser) took 14975.64 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 503.3 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -195.5 MB). Peak memory consumption was 307.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:27:36,846 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:27:36,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.24 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:27:36,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.69 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:27:36,847 INFO L168 Benchmark]: Boogie Preprocessor took 14.65 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:27:36,850 INFO L168 Benchmark]: RCFGBuilder took 202.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:27:36,850 INFO L168 Benchmark]: TraceAbstraction took 14553.68 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -12.9 MB). Peak memory consumption was 332.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:27:36,851 INFO L168 Benchmark]: Witness Printer took 43.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:27:36,852 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.24 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.69 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.65 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 202.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14553.68 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -12.9 MB). Peak memory consumption was 332.6 MB. Max. memory is 11.5 GB. * Witness Printer took 43.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 4 error locations. SAFE Result, 14.5s OverallTime, 25 OverallIterations, 18 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 551 SDtfs, 1758 SDslu, 3536 SDs, 0 SdLazy, 6014 SolverSat, 1044 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3079 GetRequests, 2052 SyntacticMatches, 0 SemanticMatches, 1027 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16266 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.8666666666666667 AbsIntWeakeningRatio, 0.3333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 2.8 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 49 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 200 PreInvPairs, 212 NumberOfFragments, 107 HoareAnnotationTreeSize, 200 FomulaSimplifications, 546 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 259 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2401 NumberOfCodeBlocks, 2371 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 3424 ConstructedInterpolants, 0 QuantifiedInterpolants, 793030 SizeOfPredicates, 94 NumberOfNonLiveVariables, 2046 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 55 InterpolantComputations, 13 PerfectInterpolantSequences, 7952/13649 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...