./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 934ee9c856a834ce808d29dea79c6912619f897f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:14:09,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:14:09,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:14:09,601 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:14:09,601 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:14:09,602 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:14:09,603 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:14:09,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:14:09,605 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:14:09,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:14:09,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:14:09,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:14:09,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:14:09,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:14:09,608 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:14:09,609 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:14:09,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:14:09,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:14:09,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:14:09,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:14:09,614 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:14:09,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:14:09,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:14:09,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:14:09,617 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:14:09,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:14:09,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:14:09,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:14:09,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:14:09,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:14:09,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:14:09,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:14:09,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:14:09,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:14:09,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:14:09,622 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:14:09,622 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:14:09,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:14:09,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:14:09,633 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:14:09,633 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:14:09,633 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:14:09,633 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:14:09,634 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:14:09,634 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:14:09,634 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:14:09,634 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:14:09,634 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:14:09,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:14:09,635 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:14:09,635 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:14:09,635 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:14:09,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:14:09,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:14:09,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:14:09,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:14:09,636 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:14:09,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:14:09,636 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:14:09,636 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:14:09,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:14:09,637 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:14:09,637 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:14:09,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:14:09,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:14:09,637 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:14:09,638 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:14:09,638 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:14:09,638 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:14:09,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:14:09,638 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:14:09,638 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_d803ece8-0cd4-417b-83b1-a0e4639243c3/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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 934ee9c856a834ce808d29dea79c6912619f897f [2018-11-10 13:14:09,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:14:09,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:14:09,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:14:09,675 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:14:09,675 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:14:09,675 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-10 13:14:09,720 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/data/1f4a0006c/bce2d1b4db6a4e389374f1894f4fc19c/FLAG3066f555f [2018-11-10 13:14:10,045 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:14:10,045 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/sv-benchmarks/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-10 13:14:10,050 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/data/1f4a0006c/bce2d1b4db6a4e389374f1894f4fc19c/FLAG3066f555f [2018-11-10 13:14:10,060 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/data/1f4a0006c/bce2d1b4db6a4e389374f1894f4fc19c [2018-11-10 13:14:10,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:14:10,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:14:10,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:14:10,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:14:10,066 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:14:10,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:14:10" (1/1) ... [2018-11-10 13:14:10,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12305cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10, skipping insertion in model container [2018-11-10 13:14:10,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:14:10" (1/1) ... [2018-11-10 13:14:10,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:14:10,088 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:14:10,186 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:14:10,188 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:14:10,199 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:14:10,208 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:14:10,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10 WrapperNode [2018-11-10 13:14:10,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:14:10,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:14:10,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:14:10,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:14:10,214 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:14:10" (1/1) ... [2018-11-10 13:14:10,217 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:14:10" (1/1) ... [2018-11-10 13:14:10,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:14:10,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:14:10,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:14:10,222 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:14:10,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10" (1/1) ... [2018-11-10 13:14:10,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10" (1/1) ... [2018-11-10 13:14:10,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10" (1/1) ... [2018-11-10 13:14:10,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10" (1/1) ... [2018-11-10 13:14:10,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10" (1/1) ... [2018-11-10 13:14:10,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10" (1/1) ... [2018-11-10 13:14:10,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10" (1/1) ... [2018-11-10 13:14:10,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:14:10,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:14:10,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:14:10,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:14:10,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/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:14:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:14:10,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:14:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:14:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:14:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:14:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:14:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 13:14:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 13:14:10,420 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:14:10,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:14:10 BoogieIcfgContainer [2018-11-10 13:14:10,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:14:10,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:14:10,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:14:10,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:14:10,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:14:10" (1/3) ... [2018-11-10 13:14:10,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e8da6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:14:10, skipping insertion in model container [2018-11-10 13:14:10,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:14:10" (2/3) ... [2018-11-10 13:14:10,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e8da6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:14:10, skipping insertion in model container [2018-11-10 13:14:10,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:14:10" (3/3) ... [2018-11-10 13:14:10,426 INFO L112 eAbstractionObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2018-11-10 13:14:10,431 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:14:10,435 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:14:10,444 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:14:10,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:14:10,463 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:14:10,463 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:14:10,463 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:14:10,464 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:14:10,464 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:14:10,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:14:10,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:14:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-10 13:14:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 13:14:10,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:14:10,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:10,483 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:14:10,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 416534784, now seen corresponding path program 1 times [2018-11-10 13:14:10,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:14:10,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:10,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:10,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:10,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:14:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:10,614 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:14:10,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:14:10,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:14:10,616 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:14:10,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:14:10,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:14:10,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:14:10,634 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-11-10 13:14:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:10,718 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2018-11-10 13:14:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:14:10,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 13:14:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:14:10,724 INFO L225 Difference]: With dead ends: 63 [2018-11-10 13:14:10,724 INFO L226 Difference]: Without dead ends: 31 [2018-11-10 13:14:10,726 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:14:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-10 13:14:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-10 13:14:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 13:14:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-10 13:14:10,754 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2018-11-10 13:14:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:14:10,754 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-10 13:14:10,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:14:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-10 13:14:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 13:14:10,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:14:10,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:10,756 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:14:10,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1670630326, now seen corresponding path program 1 times [2018-11-10 13:14:10,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:14:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:10,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:10,757 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:14:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:10,823 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:14:10,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:14:10,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:14:10,824 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:14:10,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:14:10,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:14:10,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:14:10,826 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-10 13:14:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:10,941 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-10 13:14:10,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:14:10,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-10 13:14:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:14:10,943 INFO L225 Difference]: With dead ends: 44 [2018-11-10 13:14:10,943 INFO L226 Difference]: Without dead ends: 42 [2018-11-10 13:14:10,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:14:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-10 13:14:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-11-10 13:14:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 13:14:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-10 13:14:10,952 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 19 [2018-11-10 13:14:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:14:10,953 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-10 13:14:10,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:14:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-10 13:14:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 13:14:10,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:14:10,954 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:10,954 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:14:10,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash 767827044, now seen corresponding path program 1 times [2018-11-10 13:14:10,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:14:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:10,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:10,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:14:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:11,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:11,007 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:14:11,007 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-10 13:14:11,009 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [33], [53], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86] [2018-11-10 13:14:11,041 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:14:11,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:14:11,134 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:14:11,135 INFO L272 AbstractInterpreter]: Visited 20 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-11-10 13:14:11,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:11,139 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:14:11,202 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 54.44% of their original sizes. [2018-11-10 13:14:11,202 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:14:11,305 INFO L415 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2018-11-10 13:14:11,305 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:14:11,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:14:11,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-11-10 13:14:11,306 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:14:11,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:14:11,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:14:11,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:14:11,307 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2018-11-10 13:14:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:11,955 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-11-10 13:14:11,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 13:14:11,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-10 13:14:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:14:11,957 INFO L225 Difference]: With dead ends: 107 [2018-11-10 13:14:11,957 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 13:14:11,958 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:14:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 13:14:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2018-11-10 13:14:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 13:14:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-10 13:14:11,971 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-11-10 13:14:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:14:11,972 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-10 13:14:11,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:14:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-10 13:14:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 13:14:11,973 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:14:11,973 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:11,973 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:14:11,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:11,973 INFO L82 PathProgramCache]: Analyzing trace with hash -676333797, now seen corresponding path program 1 times [2018-11-10 13:14:11,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:14:11,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:11,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:11,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:11,975 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:14:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:14:12,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:12,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:14:12,045 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-10 13:14:12,045 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [33], [36], [40], [43], [53], [57], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86] [2018-11-10 13:14:12,046 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:14:12,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:14:12,061 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:14:12,062 INFO L272 AbstractInterpreter]: Visited 23 different actions 27 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-11-10 13:14:12,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:12,063 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:14:12,091 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 46.86% of their original sizes. [2018-11-10 13:14:12,091 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:14:12,223 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-11-10 13:14:12,223 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:14:12,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:14:12,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-10 13:14:12,223 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:14:12,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 13:14:12,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 13:14:12,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:14:12,224 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 14 states. [2018-11-10 13:14:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:12,785 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2018-11-10 13:14:12,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 13:14:12,786 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-10 13:14:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:14:12,787 INFO L225 Difference]: With dead ends: 139 [2018-11-10 13:14:12,787 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 13:14:12,788 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-11-10 13:14:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 13:14:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 59. [2018-11-10 13:14:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 13:14:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-11-10 13:14:12,800 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 28 [2018-11-10 13:14:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:14:12,801 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-10 13:14:12,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 13:14:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-10 13:14:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 13:14:12,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:14:12,802 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:12,802 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:14:12,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 542199398, now seen corresponding path program 1 times [2018-11-10 13:14:12,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:14:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:12,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:12,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:14:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 13:14:12,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:12,858 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:14:12,858 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-10 13:14:12,859 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [33], [36], [40], [43], [45], [48], [53], [57], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86] [2018-11-10 13:14:12,859 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:14:12,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:14:12,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:14:12,955 INFO L272 AbstractInterpreter]: Visited 29 different actions 313 times. Merged at 11 different actions 108 times. Widened at 3 different actions 16 times. Found 15 fixpoints after 4 different actions. Largest state had 9 variables. [2018-11-10 13:14:12,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:12,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:14:12,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:12,959 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/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:14:12,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:12,965 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:14:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:12,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:14:13,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:14:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:14:13,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:14:13,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2018-11-10 13:14:13,086 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:14:13,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:14:13,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:14:13,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:14:13,087 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 11 states. [2018-11-10 13:14:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:13,258 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2018-11-10 13:14:13,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 13:14:13,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-10 13:14:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:14:13,260 INFO L225 Difference]: With dead ends: 113 [2018-11-10 13:14:13,261 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 13:14:13,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:14:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 13:14:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-11-10 13:14:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 13:14:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2018-11-10 13:14:13,281 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 36 [2018-11-10 13:14:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:14:13,281 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-11-10 13:14:13,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:14:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-11-10 13:14:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 13:14:13,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:14:13,283 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:13,283 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:14:13,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1487760091, now seen corresponding path program 1 times [2018-11-10 13:14:13,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:14:13,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:13,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:13,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:13,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:14:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:14:13,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:13,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:14:13,387 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-10 13:14:13,387 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [31], [33], [36], [40], [43], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86], [87] [2018-11-10 13:14:13,389 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:14:13,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:14:13,489 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:14:13,489 INFO L272 AbstractInterpreter]: Visited 27 different actions 258 times. Merged at 12 different actions 107 times. Widened at 4 different actions 17 times. Found 11 fixpoints after 3 different actions. Largest state had 9 variables. [2018-11-10 13:14:13,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:13,502 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:14:13,551 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 55.5% of their original sizes. [2018-11-10 13:14:13,551 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:14:13,760 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-10 13:14:13,761 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:14:13,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:14:13,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2018-11-10 13:14:13,761 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:14:13,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 13:14:13,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 13:14:13,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:14:13,761 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 19 states. [2018-11-10 13:14:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:14,267 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2018-11-10 13:14:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 13:14:14,268 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-10 13:14:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:14:14,268 INFO L225 Difference]: With dead ends: 162 [2018-11-10 13:14:14,269 INFO L226 Difference]: Without dead ends: 113 [2018-11-10 13:14:14,269 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:14:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-10 13:14:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2018-11-10 13:14:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 13:14:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-11-10 13:14:14,288 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 47 [2018-11-10 13:14:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:14:14,289 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-11-10 13:14:14,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 13:14:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-10 13:14:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 13:14:14,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:14:14,290 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:14,290 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:14:14,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1746865647, now seen corresponding path program 1 times [2018-11-10 13:14:14,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:14:14,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:14,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:14,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:14,292 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:14:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:14:14,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:14,335 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:14:14,335 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-10 13:14:14,335 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [31], [33], [36], [40], [43], [45], [48], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86] [2018-11-10 13:14:14,336 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:14:14,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:14:14,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:14:14,437 INFO L272 AbstractInterpreter]: Visited 31 different actions 427 times. Merged at 15 different actions 163 times. Widened at 5 different actions 26 times. Found 30 fixpoints after 7 different actions. Largest state had 10 variables. [2018-11-10 13:14:14,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:14,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:14:14,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:14,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/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:14:14,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:14,458 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:14:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:14,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:14:14,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:14:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:14:14,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:14:14,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2018-11-10 13:14:14,651 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:14:14,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 13:14:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 13:14:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:14:14,652 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 12 states. [2018-11-10 13:14:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:14,892 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2018-11-10 13:14:14,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:14:14,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-10 13:14:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:14:14,895 INFO L225 Difference]: With dead ends: 255 [2018-11-10 13:14:14,895 INFO L226 Difference]: Without dead ends: 161 [2018-11-10 13:14:14,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:14:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-10 13:14:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2018-11-10 13:14:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 13:14:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 139 transitions. [2018-11-10 13:14:14,926 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 139 transitions. Word has length 52 [2018-11-10 13:14:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:14:14,926 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 139 transitions. [2018-11-10 13:14:14,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 13:14:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2018-11-10 13:14:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 13:14:14,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:14:14,928 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:14,928 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:14:14,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1720427988, now seen corresponding path program 1 times [2018-11-10 13:14:14,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:14:14,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:14,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:14,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:14,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:14:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 26 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:14:15,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:15,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:14:15,010 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-10 13:14:15,010 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [31], [33], [36], [40], [43], [45], [48], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86], [87] [2018-11-10 13:14:15,011 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:14:15,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:14:15,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:14:15,126 INFO L272 AbstractInterpreter]: Visited 32 different actions 425 times. Merged at 16 different actions 158 times. Widened at 5 different actions 23 times. Found 39 fixpoints after 9 different actions. Largest state had 10 variables. [2018-11-10 13:14:15,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:15,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:14:15,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:15,128 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/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:14:15,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:15,142 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:14:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:15,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:14:15,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:14:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 13:14:15,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:14:15,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-11-10 13:14:15,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:14:15,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 13:14:15,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 13:14:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:14:15,383 INFO L87 Difference]: Start difference. First operand 113 states and 139 transitions. Second operand 16 states. [2018-11-10 13:14:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:16,476 INFO L93 Difference]: Finished difference Result 591 states and 784 transitions. [2018-11-10 13:14:16,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-10 13:14:16,477 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-11-10 13:14:16,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:14:16,479 INFO L225 Difference]: With dead ends: 591 [2018-11-10 13:14:16,479 INFO L226 Difference]: Without dead ends: 264 [2018-11-10 13:14:16,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=864, Invalid=4248, Unknown=0, NotChecked=0, Total=5112 [2018-11-10 13:14:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-10 13:14:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 189. [2018-11-10 13:14:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 13:14:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 240 transitions. [2018-11-10 13:14:16,514 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 240 transitions. Word has length 66 [2018-11-10 13:14:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:14:16,515 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 240 transitions. [2018-11-10 13:14:16,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 13:14:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 240 transitions. [2018-11-10 13:14:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 13:14:16,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:14:16,516 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:14:16,517 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:14:16,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:14:16,517 INFO L82 PathProgramCache]: Analyzing trace with hash -355759697, now seen corresponding path program 2 times [2018-11-10 13:14:16,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:14:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:16,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:14:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:14:16,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:14:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:14:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 70 proven. 59 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-11-10 13:14:16,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:16,600 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:14:16,600 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:14:16,601 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:14:16,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:14:16,601 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/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:14:16,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:14:16,606 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:14:16,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 13:14:16,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:14:16,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:14:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-10 13:14:16,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:14:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-10 13:14:16,721 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:14:16,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 8 [2018-11-10 13:14:16,722 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:14:16,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:14:16,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:14:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:14:16,723 INFO L87 Difference]: Start difference. First operand 189 states and 240 transitions. Second operand 4 states. [2018-11-10 13:14:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:14:16,797 INFO L93 Difference]: Finished difference Result 248 states and 313 transitions. [2018-11-10 13:14:16,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:14:16,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-10 13:14:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:14:16,798 INFO L225 Difference]: With dead ends: 248 [2018-11-10 13:14:16,798 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:14:16,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:14:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:14:16,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:14:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:14:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:14:16,800 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2018-11-10 13:14:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:14:16,800 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:14:16,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:14:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:14:16,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:14:16,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:14:16,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:16,983 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 144 [2018-11-10 13:14:17,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,227 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 177 [2018-11-10 13:14:17,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,450 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 166 [2018-11-10 13:14:17,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,662 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 168 [2018-11-10 13:14:17,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:17,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:14:18,143 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 26 [2018-11-10 13:14:24,845 WARN L179 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 175 DAG size of output: 38 [2018-11-10 13:14:25,194 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 26 [2018-11-10 13:14:25,597 WARN L179 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 26 [2018-11-10 13:14:25,712 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 31 [2018-11-10 13:14:26,014 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 26 [2018-11-10 13:14:26,016 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 13:14:26,016 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:14:26,016 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:14:26,016 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:14:26,016 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:14:26,016 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:14:26,016 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (and (let ((.cse1 (* 2 main_~n~0))) (and (<= .cse1 1999998) (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0)) (<= 0 (+ .cse1 4294967296)))) (<= main_~k~0 main_~n~0)))) (or (and (<= (+ main_~j~0 1) main_~n~0) .cse0) (and .cse0 (<= main_~j~0 main_~i~0)))) [2018-11-10 13:14:26,016 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (and (let ((.cse1 (* 2 main_~n~0))) (and (<= .cse1 1999998) (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0)) (<= 0 (+ .cse1 4294967296)))) (<= main_~k~0 main_~n~0)))) (or (and (<= (+ main_~j~0 1) main_~n~0) .cse0) (and .cse0 (<= main_~j~0 main_~i~0)))) [2018-11-10 13:14:26,016 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2018-11-10 13:14:26,016 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (and (let ((.cse1 (* 2 main_~i~0)) (.cse2 (* 2 main_~n~0))) (and (<= .cse1 main_~j~0) (<= .cse2 1999998) (<= .cse1 main_~k~0) (<= 0 (+ .cse2 4294967296)))) (<= (+ main_~k~0 1) main_~n~0)))) (or (and .cse0 (<= (+ main_~j~0 1) main_~n~0)) (and (<= main_~j~0 main_~i~0) .cse0))) [2018-11-10 13:14:26,017 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2018-11-10 13:14:26,017 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 31) no Hoare annotation was computed. [2018-11-10 13:14:26,017 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 31) no Hoare annotation was computed. [2018-11-10 13:14:26,017 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2018-11-10 13:14:26,017 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 31) the Hoare annotation is: (let ((.cse6 (* 2 main_~n~0))) (let ((.cse0 (* 2 main_~i~0)) (.cse1 (<= .cse6 1999998)) (.cse2 (<= 0 (+ .cse6 4294967296))) (.cse5 (<= main_~k~0 main_~n~0)) (.cse3 (<= main_~n~0 main_~k~0)) (.cse4 (<= main_~n~0 main_~j~0))) (or (and (<= main_~k~0 (+ .cse0 1)) .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= main_~j~0 main_~i~0) .cse2 .cse3 .cse4) (and .cse1 (<= main_~j~0 .cse0) .cse2 .cse3 .cse4) (and .cse3 (<= main_~n~0 (+ main_~i~0 999999)) .cse2 .cse5 (= main_~i~0 0)) (and .cse1 .cse2 .cse5 .cse3 .cse4)))) [2018-11-10 13:14:26,017 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2018-11-10 13:14:26,017 INFO L428 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2018-11-10 13:14:26,017 INFO L425 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2018-11-10 13:14:26,017 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 30) no Hoare annotation was computed. [2018-11-10 13:14:26,017 INFO L421 ceAbstractionStarter]: At program point L20-3(lines 20 30) the Hoare annotation is: (let ((.cse2 (* 2 main_~i~0))) (let ((.cse0 (let ((.cse3 (* 2 main_~n~0))) (and (<= .cse3 1999998) (and (<= .cse2 main_~j~0) (<= main_~n~0 main_~k~0)) (<= 0 (+ .cse3 4294967296))))) (.cse1 (<= main_~k~0 main_~j~0))) (or (and .cse0 (<= main_~k~0 main_~n~0)) (and .cse0 (<= main_~j~0 (+ main_~i~0 1)) .cse1) (and (exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= (+ v_main_~i~0_13 1) main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 (+ (* 2 v_main_~i~0_13) 2)))) .cse0 (<= main_~j~0 .cse2)) (and (<= main_~k~0 (+ .cse2 1)) .cse0 .cse1)))) [2018-11-10 13:14:26,017 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2018-11-10 13:14:26,017 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2018-11-10 13:14:26,018 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2018-11-10 13:14:26,018 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 24) no Hoare annotation was computed. [2018-11-10 13:14:26,018 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 24) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (* 2 main_~i~0)) (.cse2 (* 2 main_~n~0))) (and (<= .cse1 main_~j~0) (<= .cse2 1999998) (<= .cse1 main_~k~0) (<= 0 (+ .cse2 4294967296)))))) (or (and .cse0 (<= main_~j~0 main_~i~0) (<= main_~k~0 main_~j~0)) (and (<= (+ main_~j~0 1) main_~n~0) (and .cse0 (<= main_~k~0 main_~n~0))))) [2018-11-10 13:14:26,018 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-10 13:14:26,018 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-10 13:14:26,018 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-10 13:14:26,018 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-10 13:14:26,018 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-10 13:14:26,018 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-10 13:14:26,018 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-10 13:14:26,022 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-10 13:14:26,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 13:14:26,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 13:14:26,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-10 13:14:26,026 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-10 13:14:26,026 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 13:14:26,027 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 13:14:26,027 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-10 13:14:26,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:14:26 BoogieIcfgContainer [2018-11-10 13:14:26,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:14:26,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:14:26,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:14:26,031 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:14:26,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:14:10" (3/4) ... [2018-11-10 13:14:26,035 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:14:26,039 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:14:26,040 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:14:26,040 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 13:14:26,042 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-10 13:14:26,042 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 13:14:26,042 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 13:14:26,042 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 13:14:26,057 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && k <= n) || ((((2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && j <= i + 1) && k <= j)) || (((\exists main_~i~0 : int, v_main_~i~0_13 : int :: (v_main_~i~0_13 + 1 <= main_~i~0 && 2 * main_~i~0 <= j) && n <= 2 * v_main_~i~0_13 + 2) && (2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && j <= 2 * i)) || ((k <= 2 * i + 1 && (2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && k <= j) [2018-11-10 13:14:26,071 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d803ece8-0cd4-417b-83b1-a0e4639243c3/bin-2019/utaipan/witness.graphml [2018-11-10 13:14:26,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:14:26,072 INFO L168 Benchmark]: Toolchain (without parser) took 16010.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.7 MB). Free memory was 954.8 MB in the beginning and 866.6 MB in the end (delta: 88.3 MB). Peak memory consumption was 458.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:26,073 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:14:26,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:26,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.57 ms. Allocated memory is still 1.0 GB. Free memory is still 944.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:14:26,074 INFO L168 Benchmark]: Boogie Preprocessor took 12.81 ms. Allocated memory is still 1.0 GB. Free memory was 944.0 MB in the beginning and 941.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:26,074 INFO L168 Benchmark]: RCFGBuilder took 186.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 941.3 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:26,074 INFO L168 Benchmark]: TraceAbstraction took 15608.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.2 GB in the beginning and 876.2 MB in the end (delta: 277.0 MB). Peak memory consumption was 502.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:26,075 INFO L168 Benchmark]: Witness Printer took 41.39 ms. Allocated memory is still 1.4 GB. Free memory was 876.2 MB in the beginning and 866.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:14:26,077 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.44 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.57 ms. Allocated memory is still 1.0 GB. Free memory is still 944.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.81 ms. Allocated memory is still 1.0 GB. Free memory was 944.0 MB in the beginning and 941.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 186.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 941.3 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15608.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 204.5 MB). Free memory was 1.2 GB in the beginning and 876.2 MB in the end (delta: 277.0 MB). Peak memory consumption was 502.0 MB. Max. memory is 11.5 GB. * Witness Printer took 41.39 ms. Allocated memory is still 1.4 GB. Free memory was 876.2 MB in the beginning and 866.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant [2018-11-10 13:14:26,081 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-10 13:14:26,081 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 13:14:26,081 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 13:14:26,081 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-10 13:14:26,082 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-10 13:14:26,082 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 13:14:26,082 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-10 13:14:26,082 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] Derived loop invariant: (((((2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && k <= n) || ((((2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && j <= i + 1) && k <= j)) || (((\exists main_~i~0 : int, v_main_~i~0_13 : int :: (v_main_~i~0_13 + 1 <= main_~i~0 && 2 * main_~i~0 <= j) && n <= 2 * v_main_~i~0_13 + 2) && (2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && j <= 2 * i)) || ((k <= 2 * i + 1 && (2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && k <= j) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((2 * i <= j && 2 * n <= 1999998) && 2 * i <= k) && 0 <= 2 * n + 4294967296) && j <= i) && k <= j) || (j + 1 <= n && (((2 * i <= j && 2 * n <= 1999998) && 2 * i <= k) && 0 <= 2 * n + 4294967296) && k <= n) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((k <= 2 * i + 1 && 2 * n <= 1999998) && 0 <= 2 * n + 4294967296) && n <= k) && n <= j) || ((((2 * n <= 1999998 && j <= i) && 0 <= 2 * n + 4294967296) && n <= k) && n <= j)) || ((((2 * n <= 1999998 && j <= 2 * i) && 0 <= 2 * n + 4294967296) && n <= k) && n <= j)) || ((((n <= k && n <= i + 999999) && 0 <= 2 * n + 4294967296) && k <= n) && i == 0)) || ((((2 * n <= 1999998 && 0 <= 2 * n + 4294967296) && k <= n) && n <= k) && n <= j) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. SAFE Result, 15.5s OverallTime, 9 OverallIterations, 11 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 9.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 305 SDtfs, 760 SDslu, 1160 SDs, 0 SdLazy, 1038 SolverSat, 495 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 767 GetRequests, 577 SyntacticMatches, 14 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2038 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 6 AbstIntIterations, 3 AbstIntStrong, 0.9317164809186083 AbsIntWeakeningRatio, 0.43617021276595747 AbsIntAvgWeakeningVarsNumRemoved, 7.24468085106383 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 231 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 126 PreInvPairs, 301 NumberOfFragments, 520 HoareAnnotationTreeSize, 126 FomulaSimplifications, 338607 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 12 FomulaSimplificationsInter, 116766 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 657 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 902 ConstructedInterpolants, 6 QuantifiedInterpolants, 123828 SizeOfPredicates, 20 NumberOfNonLiveVariables, 383 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 1324/1500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...