./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:59:52,665 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:59:52,666 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:59:52,672 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:59:52,672 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:59:52,672 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:59:52,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:59:52,674 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:59:52,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:59:52,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:59:52,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:59:52,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:59:52,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:59:52,676 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:59:52,677 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:59:52,677 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:59:52,678 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:59:52,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:59:52,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:59:52,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:59:52,681 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:59:52,681 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:59:52,682 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:59:52,682 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:59:52,683 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:59:52,683 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:59:52,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:59:52,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:59:52,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:59:52,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:59:52,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:59:52,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:59:52,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:59:52,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:59:52,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:59:52,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:59:52,686 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 12:59:52,693 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:59:52,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:59:52,694 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:59:52,694 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:59:52,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:59:52,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:59:52,695 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 12:59:52,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:59:52,695 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:59:52,695 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:59:52,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:59:52,695 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:59:52,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:59:52,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:59:52,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:59:52,696 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:59:52,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:59:52,696 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 12:59:52,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:59:52,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:59:52,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:59:52,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:59:52,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:59:52,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:59:52,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:59:52,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:59:52,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:59:52,697 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 12:59:52,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:59:52,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:59:52,697 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer 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 -> Automizer 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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2018-12-09 12:59:52,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:59:52,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:59:52,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:59:52,728 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:59:52,728 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:59:52,729 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-12-09 12:59:52,774 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/data/23cc0069a/d442ee14ce0e4899ab7ae6a5de871635/FLAGf9bc8a639 [2018-12-09 12:59:53,251 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:59:53,252 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-12-09 12:59:53,258 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/data/23cc0069a/d442ee14ce0e4899ab7ae6a5de871635/FLAGf9bc8a639 [2018-12-09 12:59:53,268 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/data/23cc0069a/d442ee14ce0e4899ab7ae6a5de871635 [2018-12-09 12:59:53,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:59:53,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:59:53,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:59:53,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:59:53,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:59:53,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cdf4af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53, skipping insertion in model container [2018-12-09 12:59:53,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:59:53,305 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:59:53,454 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:59:53,457 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:59:53,492 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:59:53,532 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:59:53,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53 WrapperNode [2018-12-09 12:59:53,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:59:53,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:59:53,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:59:53,533 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:59:53,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:59:53,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:59:53,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:59:53,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:59:53,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... [2018-12-09 12:59:53,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:59:53,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:59:53,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:59:53,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:59:53,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/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-12-09 12:59:53,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 12:59:53,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 12:59:53,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:59:53,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:59:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 12:59:53,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 12:59:54,017 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:59:54,017 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 12:59:54,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:54 BoogieIcfgContainer [2018-12-09 12:59:54,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:59:54,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:59:54,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:59:54,021 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:59:54,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:59:53" (1/3) ... [2018-12-09 12:59:54,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149b53ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:59:54, skipping insertion in model container [2018-12-09 12:59:54,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:53" (2/3) ... [2018-12-09 12:59:54,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149b53ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:59:54, skipping insertion in model container [2018-12-09 12:59:54,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:54" (3/3) ... [2018-12-09 12:59:54,023 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-12-09 12:59:54,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:59:54,036 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 12:59:54,045 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 12:59:54,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 12:59:54,062 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:59:54,063 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:59:54,063 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:59:54,063 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:59:54,063 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:59:54,063 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:59:54,063 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:59:54,063 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:59:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-12-09 12:59:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 12:59:54,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:54,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:54,081 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:54,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1483071650, now seen corresponding path program 1 times [2018-12-09 12:59:54,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:54,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:54,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:54,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:59:54,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 12:59:54,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 12:59:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 12:59:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 12:59:54,189 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-12-09 12:59:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:54,207 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-12-09 12:59:54,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 12:59:54,208 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-12-09 12:59:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:54,215 INFO L225 Difference]: With dead ends: 222 [2018-12-09 12:59:54,215 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 12:59:54,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 12:59:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 12:59:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-09 12:59:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 12:59:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-12-09 12:59:54,240 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-12-09 12:59:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:54,241 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-12-09 12:59:54,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 12:59:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-12-09 12:59:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 12:59:54,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:54,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:54,241 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:54,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash -736931587, now seen corresponding path program 1 times [2018-12-09 12:59:54,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:54,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:54,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:54,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:59:54,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:59:54,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:59:54,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:59:54,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:54,271 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-12-09 12:59:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:54,314 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-12-09 12:59:54,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:59:54,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 12:59:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:54,315 INFO L225 Difference]: With dead ends: 205 [2018-12-09 12:59:54,315 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 12:59:54,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 12:59:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 12:59:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 12:59:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-12-09 12:59:54,321 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-12-09 12:59:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:54,321 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-12-09 12:59:54,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:59:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-12-09 12:59:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 12:59:54,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:54,322 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:54,322 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:54,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:54,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1504395429, now seen corresponding path program 1 times [2018-12-09 12:59:54,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:54,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:54,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:54,716 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 39 [2018-12-09 12:59:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:54,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:59:54,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:59:54,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:59:54,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:59:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:59:54,719 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2018-12-09 12:59:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:54,891 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-12-09 12:59:54,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:59:54,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-09 12:59:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:54,893 INFO L225 Difference]: With dead ends: 209 [2018-12-09 12:59:54,893 INFO L226 Difference]: Without dead ends: 190 [2018-12-09 12:59:54,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:59:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-09 12:59:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-12-09 12:59:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-09 12:59:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-12-09 12:59:54,900 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-12-09 12:59:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:54,900 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-12-09 12:59:54,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:59:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-12-09 12:59:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 12:59:54,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:54,901 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:54,901 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:54,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2142865338, now seen corresponding path program 1 times [2018-12-09 12:59:54,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:54,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:54,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:54,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:54,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:59:54,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:59:54,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:59:54,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:59:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:54,923 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-12-09 12:59:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:54,944 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-12-09 12:59:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:59:54,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 12:59:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:54,945 INFO L225 Difference]: With dead ends: 297 [2018-12-09 12:59:54,945 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 12:59:54,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 12:59:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-12-09 12:59:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-09 12:59:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-12-09 12:59:54,951 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-12-09 12:59:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:54,951 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-12-09 12:59:54,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:59:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-12-09 12:59:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 12:59:54,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:54,952 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:54,952 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:54,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2011475352, now seen corresponding path program 1 times [2018-12-09 12:59:54,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:54,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 12:59:54,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:59:54,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:59:54,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:59:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:59:54,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:54,983 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-12-09 12:59:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:55,004 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-12-09 12:59:55,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:59:55,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 12:59:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:55,005 INFO L225 Difference]: With dead ends: 230 [2018-12-09 12:59:55,005 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 12:59:55,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 12:59:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-12-09 12:59:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 12:59:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-12-09 12:59:55,012 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-12-09 12:59:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:55,012 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-12-09 12:59:55,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:59:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-12-09 12:59:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 12:59:55,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:55,013 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:55,014 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:55,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1818456969, now seen corresponding path program 1 times [2018-12-09 12:59:55,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:55,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:55,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:55,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:59:55,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/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-12-09 12:59:55,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:55,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:59:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:55,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:59:55,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-09 12:59:55,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:59:55,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:59:55,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:59:55,153 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-12-09 12:59:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:55,247 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-12-09 12:59:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:59:55,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-09 12:59:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:55,249 INFO L225 Difference]: With dead ends: 192 [2018-12-09 12:59:55,249 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 12:59:55,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:59:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 12:59:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-12-09 12:59:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 12:59:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-12-09 12:59:55,256 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-12-09 12:59:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:55,257 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-12-09 12:59:55,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:59:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-12-09 12:59:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 12:59:55,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:55,258 INFO L402 BasicCegarLoop]: trace histogram [3, 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-12-09 12:59:55,258 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:55,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash 549034740, now seen corresponding path program 1 times [2018-12-09 12:59:55,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:55,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:55,481 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 33 [2018-12-09 12:59:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:55,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:59:55,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/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-12-09 12:59:55,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:55,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:59:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:55,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:59:55,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-09 12:59:55,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:59:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:59:55,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:59:55,581 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 6 states. [2018-12-09 12:59:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:55,696 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2018-12-09 12:59:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:59:55,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 12:59:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:55,697 INFO L225 Difference]: With dead ends: 230 [2018-12-09 12:59:55,698 INFO L226 Difference]: Without dead ends: 226 [2018-12-09 12:59:55,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:59:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-09 12:59:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2018-12-09 12:59:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-09 12:59:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2018-12-09 12:59:55,703 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 28 [2018-12-09 12:59:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:55,703 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2018-12-09 12:59:55,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:59:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2018-12-09 12:59:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 12:59:55,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:55,703 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:55,704 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:55,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:55,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1113591962, now seen corresponding path program 1 times [2018-12-09 12:59:55,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:55,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:55,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:55,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:55,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 12:59:55,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:59:55,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:59:55,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:59:55,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:59:55,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:55,718 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand 3 states. [2018-12-09 12:59:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:55,733 INFO L93 Difference]: Finished difference Result 391 states and 608 transitions. [2018-12-09 12:59:55,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:59:55,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 12:59:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:55,735 INFO L225 Difference]: With dead ends: 391 [2018-12-09 12:59:55,735 INFO L226 Difference]: Without dead ends: 202 [2018-12-09 12:59:55,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-09 12:59:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-12-09 12:59:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-09 12:59:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2018-12-09 12:59:55,739 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 29 [2018-12-09 12:59:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:55,739 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2018-12-09 12:59:55,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:59:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2018-12-09 12:59:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 12:59:55,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:55,740 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:55,740 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:55,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash 454582667, now seen corresponding path program 1 times [2018-12-09 12:59:55,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:55,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:55,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:55,911 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2018-12-09 12:59:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:55,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:59:55,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/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-12-09 12:59:55,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:55,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:59:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 12:59:55,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 12:59:55,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-12-09 12:59:55,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:59:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:59:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:59:55,983 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 6 states. [2018-12-09 12:59:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:56,107 INFO L93 Difference]: Finished difference Result 357 states and 542 transitions. [2018-12-09 12:59:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:59:56,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-09 12:59:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:56,108 INFO L225 Difference]: With dead ends: 357 [2018-12-09 12:59:56,108 INFO L226 Difference]: Without dead ends: 341 [2018-12-09 12:59:56,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:59:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-12-09 12:59:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 312. [2018-12-09 12:59:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-12-09 12:59:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 471 transitions. [2018-12-09 12:59:56,114 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 471 transitions. Word has length 31 [2018-12-09 12:59:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:56,114 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 471 transitions. [2018-12-09 12:59:56,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:59:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 471 transitions. [2018-12-09 12:59:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 12:59:56,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:56,115 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:56,115 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:56,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1646630523, now seen corresponding path program 1 times [2018-12-09 12:59:56,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:56,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:56,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:56,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 12:59:56,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:59:56,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:59:56,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:59:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:59:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:56,133 INFO L87 Difference]: Start difference. First operand 312 states and 471 transitions. Second operand 3 states. [2018-12-09 12:59:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:56,148 INFO L93 Difference]: Finished difference Result 512 states and 778 transitions. [2018-12-09 12:59:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:59:56,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-09 12:59:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:56,149 INFO L225 Difference]: With dead ends: 512 [2018-12-09 12:59:56,149 INFO L226 Difference]: Without dead ends: 246 [2018-12-09 12:59:56,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-09 12:59:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2018-12-09 12:59:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-09 12:59:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 364 transitions. [2018-12-09 12:59:56,154 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 364 transitions. Word has length 37 [2018-12-09 12:59:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:56,155 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 364 transitions. [2018-12-09 12:59:56,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:59:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 364 transitions. [2018-12-09 12:59:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 12:59:56,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:56,156 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:56,156 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:56,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash 939353414, now seen corresponding path program 1 times [2018-12-09 12:59:56,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:56,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:56,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:56,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:56,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:59:56,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/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-12-09 12:59:56,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:56,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:59:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:56,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:59:56,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-09 12:59:56,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:59:56,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:59:56,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:59:56,389 INFO L87 Difference]: Start difference. First operand 244 states and 364 transitions. Second operand 8 states. [2018-12-09 12:59:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:56,499 INFO L93 Difference]: Finished difference Result 254 states and 373 transitions. [2018-12-09 12:59:56,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:59:56,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-09 12:59:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:56,500 INFO L225 Difference]: With dead ends: 254 [2018-12-09 12:59:56,500 INFO L226 Difference]: Without dead ends: 252 [2018-12-09 12:59:56,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:59:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-12-09 12:59:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-12-09 12:59:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-09 12:59:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2018-12-09 12:59:56,505 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 40 [2018-12-09 12:59:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:56,505 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2018-12-09 12:59:56,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:59:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2018-12-09 12:59:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 12:59:56,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:56,505 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:56,506 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:56,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash -819577482, now seen corresponding path program 1 times [2018-12-09 12:59:56,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:56,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:56,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:56,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 12:59:56,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:59:56,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:59:56,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:59:56,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:59:56,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:56,522 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2018-12-09 12:59:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:56,551 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2018-12-09 12:59:56,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:59:56,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-09 12:59:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:56,552 INFO L225 Difference]: With dead ends: 428 [2018-12-09 12:59:56,552 INFO L226 Difference]: Without dead ends: 229 [2018-12-09 12:59:56,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-09 12:59:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-12-09 12:59:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-09 12:59:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2018-12-09 12:59:56,559 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2018-12-09 12:59:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:56,560 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2018-12-09 12:59:56,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:59:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2018-12-09 12:59:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 12:59:56,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:56,560 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:56,561 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:56,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash 711556807, now seen corresponding path program 1 times [2018-12-09 12:59:56,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 12:59:56,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:59:56,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:59:56,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:59:56,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:59:56,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:56,591 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2018-12-09 12:59:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:56,612 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2018-12-09 12:59:56,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:59:56,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 12:59:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:56,612 INFO L225 Difference]: With dead ends: 309 [2018-12-09 12:59:56,613 INFO L226 Difference]: Without dead ends: 147 [2018-12-09 12:59:56,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:59:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-09 12:59:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-12-09 12:59:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-09 12:59:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-12-09 12:59:56,616 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2018-12-09 12:59:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:56,616 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-12-09 12:59:56,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:59:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-12-09 12:59:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 12:59:56,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:56,617 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:56,617 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:56,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:56,617 INFO L82 PathProgramCache]: Analyzing trace with hash -370372205, now seen corresponding path program 1 times [2018-12-09 12:59:56,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:56,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:56,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:56,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 12:59:56,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:59:56,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:59:56,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:56,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:59:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:56,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:59:56,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-12-09 12:59:56,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 12:59:56,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:59:56,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:59:56,790 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 9 states. [2018-12-09 12:59:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:56,874 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2018-12-09 12:59:56,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:59:56,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-12-09 12:59:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:56,875 INFO L225 Difference]: With dead ends: 188 [2018-12-09 12:59:56,875 INFO L226 Difference]: Without dead ends: 184 [2018-12-09 12:59:56,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:59:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-09 12:59:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-12-09 12:59:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-09 12:59:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2018-12-09 12:59:56,881 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 51 [2018-12-09 12:59:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:56,881 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2018-12-09 12:59:56,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 12:59:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2018-12-09 12:59:56,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 12:59:56,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:56,882 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:56,882 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:56,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash -379328264, now seen corresponding path program 1 times [2018-12-09 12:59:56,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:56,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:59,280 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 194 DAG size of output: 36 [2018-12-09 12:59:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:59,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 12:59:59,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 12:59:59,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:59:59,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 12:59:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:59:59,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 12:59:59,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-09 12:59:59,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 12:59:59,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 12:59:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:59:59,439 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand 11 states. [2018-12-09 12:59:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:59:59,689 INFO L93 Difference]: Finished difference Result 187 states and 260 transitions. [2018-12-09 12:59:59,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:59:59,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-12-09 12:59:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:59:59,690 INFO L225 Difference]: With dead ends: 187 [2018-12-09 12:59:59,691 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 12:59:59,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:59:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 12:59:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-12-09 12:59:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-09 12:59:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 255 transitions. [2018-12-09 12:59:59,697 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 255 transitions. Word has length 61 [2018-12-09 12:59:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:59:59,697 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 255 transitions. [2018-12-09 12:59:59,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 12:59:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 255 transitions. [2018-12-09 12:59:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 12:59:59,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:59:59,698 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:59:59,698 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:59:59,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:59:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash 638427137, now seen corresponding path program 1 times [2018-12-09 12:59:59,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 12:59:59,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 12:59:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:59,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:59:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:59:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:00,016 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 33 [2018-12-09 13:00:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:00,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:00,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:00,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:00,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:00,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:00,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-12-09 13:00:00,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 13:00:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 13:00:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 13:00:00,114 INFO L87 Difference]: Start difference. First operand 182 states and 255 transitions. Second operand 9 states. [2018-12-09 13:00:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:00,219 INFO L93 Difference]: Finished difference Result 203 states and 284 transitions. [2018-12-09 13:00:00,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 13:00:00,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-12-09 13:00:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:00,220 INFO L225 Difference]: With dead ends: 203 [2018-12-09 13:00:00,220 INFO L226 Difference]: Without dead ends: 200 [2018-12-09 13:00:00,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 13:00:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-09 13:00:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-12-09 13:00:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-09 13:00:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 280 transitions. [2018-12-09 13:00:00,227 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 280 transitions. Word has length 70 [2018-12-09 13:00:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:00,227 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 280 transitions. [2018-12-09 13:00:00,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 13:00:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 280 transitions. [2018-12-09 13:00:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 13:00:00,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:00,227 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:00,227 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:00,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:00,228 INFO L82 PathProgramCache]: Analyzing trace with hash -784011109, now seen corresponding path program 1 times [2018-12-09 13:00:00,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:00:00,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:00:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:00,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 13:00:00,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:00,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:00,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:00,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 13:00:00,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:00,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-09 13:00:00,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 13:00:00,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 13:00:00,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:00:00,439 INFO L87 Difference]: Start difference. First operand 200 states and 280 transitions. Second operand 7 states. [2018-12-09 13:00:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:00,501 INFO L93 Difference]: Finished difference Result 224 states and 311 transitions. [2018-12-09 13:00:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:00:00,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-12-09 13:00:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:00,503 INFO L225 Difference]: With dead ends: 224 [2018-12-09 13:00:00,503 INFO L226 Difference]: Without dead ends: 221 [2018-12-09 13:00:00,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:00:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-09 13:00:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-12-09 13:00:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-09 13:00:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2018-12-09 13:00:00,510 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 79 [2018-12-09 13:00:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:00,510 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2018-12-09 13:00:00,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 13:00:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2018-12-09 13:00:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 13:00:00,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:00,511 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:00,512 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:00,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:00,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1961279789, now seen corresponding path program 1 times [2018-12-09 13:00:00,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:00:00,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:00:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:00,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:04,893 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 133 DAG size of output: 40 [2018-12-09 13:00:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:04,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:04,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:04,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:04,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:05,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:05,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-09 13:00:05,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 13:00:05,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 13:00:05,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-09 13:00:05,034 INFO L87 Difference]: Start difference. First operand 218 states and 305 transitions. Second operand 11 states. [2018-12-09 13:00:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:05,139 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2018-12-09 13:00:05,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 13:00:05,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-12-09 13:00:05,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:05,141 INFO L225 Difference]: With dead ends: 221 [2018-12-09 13:00:05,141 INFO L226 Difference]: Without dead ends: 219 [2018-12-09 13:00:05,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-09 13:00:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-09 13:00:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-09 13:00:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-09 13:00:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 306 transitions. [2018-12-09 13:00:05,146 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 306 transitions. Word has length 82 [2018-12-09 13:00:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:05,146 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 306 transitions. [2018-12-09 13:00:05,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 13:00:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 306 transitions. [2018-12-09 13:00:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 13:00:05,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:05,147 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:05,147 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:05,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash -101241370, now seen corresponding path program 1 times [2018-12-09 13:00:05,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:00:05,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:00:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:05,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 13:00:05,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:05,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:05,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:05,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:05,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:05,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-12-09 13:00:05,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 13:00:05,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 13:00:05,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-09 13:00:05,381 INFO L87 Difference]: Start difference. First operand 219 states and 306 transitions. Second operand 15 states. [2018-12-09 13:00:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:05,458 INFO L93 Difference]: Finished difference Result 262 states and 366 transitions. [2018-12-09 13:00:05,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 13:00:05,458 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-12-09 13:00:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:05,460 INFO L225 Difference]: With dead ends: 262 [2018-12-09 13:00:05,460 INFO L226 Difference]: Without dead ends: 258 [2018-12-09 13:00:05,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-09 13:00:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-09 13:00:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2018-12-09 13:00:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-09 13:00:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 357 transitions. [2018-12-09 13:00:05,466 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 357 transitions. Word has length 93 [2018-12-09 13:00:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:05,466 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 357 transitions. [2018-12-09 13:00:05,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 13:00:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 357 transitions. [2018-12-09 13:00:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 13:00:05,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:05,467 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:05,467 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:05,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1744733813, now seen corresponding path program 2 times [2018-12-09 13:00:05,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:00:05,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:00:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:05,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:05,853 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 39 [2018-12-09 13:00:06,092 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 36 [2018-12-09 13:00:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:06,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:06,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:06,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 13:00:06,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 13:00:06,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:00:06,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:06,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:06,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-12-09 13:00:06,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 13:00:06,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 13:00:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-09 13:00:06,266 INFO L87 Difference]: Start difference. First operand 255 states and 357 transitions. Second operand 15 states. [2018-12-09 13:00:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:06,688 INFO L93 Difference]: Finished difference Result 265 states and 367 transitions. [2018-12-09 13:00:06,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 13:00:06,689 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2018-12-09 13:00:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:06,690 INFO L225 Difference]: With dead ends: 265 [2018-12-09 13:00:06,690 INFO L226 Difference]: Without dead ends: 263 [2018-12-09 13:00:06,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-12-09 13:00:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-09 13:00:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2018-12-09 13:00:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 13:00:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 358 transitions. [2018-12-09 13:00:06,698 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 358 transitions. Word has length 103 [2018-12-09 13:00:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:06,698 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 358 transitions. [2018-12-09 13:00:06,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 13:00:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 358 transitions. [2018-12-09 13:00:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 13:00:06,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:06,699 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:06,700 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:06,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 769524942, now seen corresponding path program 2 times [2018-12-09 13:00:06,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:00:06,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:00:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:06,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:00:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:07,077 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 39 [2018-12-09 13:00:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 203 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 13:00:07,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:07,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:07,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 13:00:07,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 13:00:07,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:00:07,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:07,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:07,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-12-09 13:00:07,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 13:00:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 13:00:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-12-09 13:00:07,302 INFO L87 Difference]: Start difference. First operand 256 states and 358 transitions. Second operand 21 states. [2018-12-09 13:00:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:07,552 INFO L93 Difference]: Finished difference Result 277 states and 387 transitions. [2018-12-09 13:00:07,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 13:00:07,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 112 [2018-12-09 13:00:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:07,554 INFO L225 Difference]: With dead ends: 277 [2018-12-09 13:00:07,554 INFO L226 Difference]: Without dead ends: 274 [2018-12-09 13:00:07,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-12-09 13:00:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-09 13:00:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-12-09 13:00:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-12-09 13:00:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 383 transitions. [2018-12-09 13:00:07,559 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 383 transitions. Word has length 112 [2018-12-09 13:00:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:07,559 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 383 transitions. [2018-12-09 13:00:07,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 13:00:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 383 transitions. [2018-12-09 13:00:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 13:00:07,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:07,560 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:07,560 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:07,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:07,560 INFO L82 PathProgramCache]: Analyzing trace with hash -495672722, now seen corresponding path program 2 times [2018-12-09 13:00:07,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:00:07,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:00:07,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:07,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:00:07,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 13:00:07,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:07,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:07,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 13:00:07,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 13:00:07,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:00:07,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 13:00:07,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:07,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-09 13:00:07,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 13:00:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 13:00:07,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 13:00:07,817 INFO L87 Difference]: Start difference. First operand 274 states and 383 transitions. Second operand 9 states. [2018-12-09 13:00:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:07,891 INFO L93 Difference]: Finished difference Result 298 states and 414 transitions. [2018-12-09 13:00:07,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 13:00:07,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2018-12-09 13:00:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:07,893 INFO L225 Difference]: With dead ends: 298 [2018-12-09 13:00:07,893 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 13:00:07,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 13:00:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 13:00:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-12-09 13:00:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-09 13:00:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 408 transitions. [2018-12-09 13:00:07,898 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 408 transitions. Word has length 121 [2018-12-09 13:00:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:07,898 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 408 transitions. [2018-12-09 13:00:07,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 13:00:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 408 transitions. [2018-12-09 13:00:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 13:00:07,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:07,899 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:07,899 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:07,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:07,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2006984672, now seen corresponding path program 2 times [2018-12-09 13:00:07,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:00:07,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:00:07,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:07,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:00:07,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:10,360 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 159 DAG size of output: 37 [2018-12-09 13:00:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:10,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:10,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:10,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 13:00:10,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 13:00:10,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:00:10,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:10,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:10,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-12-09 13:00:10,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 13:00:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 13:00:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-09 13:00:10,561 INFO L87 Difference]: Start difference. First operand 292 states and 408 transitions. Second operand 15 states. [2018-12-09 13:00:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:10,800 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2018-12-09 13:00:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 13:00:10,801 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 124 [2018-12-09 13:00:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:10,801 INFO L225 Difference]: With dead ends: 295 [2018-12-09 13:00:10,802 INFO L226 Difference]: Without dead ends: 293 [2018-12-09 13:00:10,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-09 13:00:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-09 13:00:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-12-09 13:00:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-12-09 13:00:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 409 transitions. [2018-12-09 13:00:10,807 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 409 transitions. Word has length 124 [2018-12-09 13:00:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:10,807 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 409 transitions. [2018-12-09 13:00:10,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 13:00:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 409 transitions. [2018-12-09 13:00:10,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-09 13:00:10,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:10,808 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-09 13:00:10,808 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:10,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1858751879, now seen corresponding path program 2 times [2018-12-09 13:00:10,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:00:10,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:00:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:10,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:00:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 13:00:10,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:10,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:10,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 13:00:11,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 13:00:11,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:00:11,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:11,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:11,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-12-09 13:00:11,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 13:00:11,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 13:00:11,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-09 13:00:11,163 INFO L87 Difference]: Start difference. First operand 293 states and 409 transitions. Second operand 21 states. [2018-12-09 13:00:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:11,341 INFO L93 Difference]: Finished difference Result 336 states and 469 transitions. [2018-12-09 13:00:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 13:00:11,341 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 135 [2018-12-09 13:00:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:11,342 INFO L225 Difference]: With dead ends: 336 [2018-12-09 13:00:11,342 INFO L226 Difference]: Without dead ends: 332 [2018-12-09 13:00:11,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-09 13:00:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-09 13:00:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2018-12-09 13:00:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-09 13:00:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 460 transitions. [2018-12-09 13:00:11,350 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 460 transitions. Word has length 135 [2018-12-09 13:00:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:11,350 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 460 transitions. [2018-12-09 13:00:11,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 13:00:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2018-12-09 13:00:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 13:00:11,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:11,351 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:11,351 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:11,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash 624796254, now seen corresponding path program 3 times [2018-12-09 13:00:11,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 13:00:11,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 13:00:11,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:11,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:00:11,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:11,888 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 39 [2018-12-09 13:00:12,150 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 36 [2018-12-09 13:00:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:12,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:12,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:12,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 13:00:12,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 13:00:12,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:00:12,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 208 proven. 26 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-09 13:00:12,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 13:00:12,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2018-12-09 13:00:12,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 13:00:12,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 13:00:12,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-12-09 13:00:12,452 INFO L87 Difference]: Start difference. First operand 329 states and 460 transitions. Second operand 23 states. [2018-12-09 13:00:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:13,256 INFO L93 Difference]: Finished difference Result 349 states and 481 transitions. [2018-12-09 13:00:13,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-09 13:00:13,256 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 145 [2018-12-09 13:00:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:13,257 INFO L225 Difference]: With dead ends: 349 [2018-12-09 13:00:13,257 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 13:00:13,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=197, Invalid=2059, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 13:00:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 13:00:13,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 13:00:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 13:00:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 13:00:13,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-12-09 13:00:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:13,258 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 13:00:13,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 13:00:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 13:00:13,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 13:00:13,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 13:00:13,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:00:13,527 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 44 [2018-12-09 13:00:13,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 13:00:13,529 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-09 13:00:13,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 13:00:13,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 13:00:13,529 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 13:00:13,529 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-12-09 13:00:13,530 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-12-09 13:00:13,531 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L444 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-12-09 13:00:13,532 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-12-09 13:00:13,533 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L444 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse0 (exists ((main_~P1~0 Int)) (let ((.cse9 (mod main_~P1~0 2))) (and (= .cse9 0) (= .cse9 (mod (+ main_~this_expect~0 1) 2)))))) (.cse6 (<= main_~this_buffer_empty~0 1)) (.cse7 (<= 1 main_~this_buffer_empty~0)) (.cse5 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse1 (<= 0 (+ main_~P8~0 2147483648))) (.cse2 (<= main_~P8~0 2147483647)) (.cse3 (<= main_~this_buffer_empty~0 0)) (.cse4 (<= 0 main_~this_buffer_empty~0))) (or (and .cse0 .cse1 (= main_~q~0 3) .cse2 .cse3 .cse4) (and .cse5 (= main_~q~0 1) .cse6 .cse1 .cse7 .cse2) (and .cse0 .cse6 .cse1 (= main_~q~0 4) .cse7 .cse2) (and .cse5 (<= 5 main_~q~0) .cse1 .cse2 .cse3 .cse4) (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse3 .cse4))) [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-12-09 13:00:13,534 INFO L448 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-12-09 13:00:13,535 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-12-09 13:00:13,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:00:13 BoogieIcfgContainer [2018-12-09 13:00:13,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 13:00:13,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 13:00:13,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 13:00:13,553 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 13:00:13,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:54" (3/4) ... [2018-12-09 13:00:13,556 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 13:00:13,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 13:00:13,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 13:00:13,564 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 13:00:13,564 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 13:00:13,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) [2018-12-09 13:00:13,587 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b4db6d75-acd5-4277-a2a6-5e54ff22ce13/bin-2019/uautomizer/witness.graphml [2018-12-09 13:00:13,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 13:00:13,588 INFO L168 Benchmark]: Toolchain (without parser) took 20317.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 415.8 MB). Free memory was 954.9 MB in the beginning and 930.5 MB in the end (delta: 24.4 MB). Peak memory consumption was 440.2 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:13,588 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:00:13,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -150.0 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:13,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:00:13,589 INFO L168 Benchmark]: Boogie Preprocessor took 26.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:00:13,589 INFO L168 Benchmark]: RCFGBuilder took 441.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:13,589 INFO L168 Benchmark]: TraceAbstraction took 19534.54 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 942.7 MB in the end (delta: 94.0 MB). Peak memory consumption was 400.2 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:13,589 INFO L168 Benchmark]: Witness Printer took 34.11 ms. Allocated memory is still 1.4 GB. Free memory was 942.7 MB in the beginning and 930.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:13,591 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -150.0 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 441.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19534.54 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 942.7 MB in the end (delta: 94.0 MB). Peak memory consumption was 400.2 MB. Max. memory is 11.5 GB. * Witness Printer took 34.11 ms. Allocated memory is still 1.4 GB. Free memory was 942.7 MB in the beginning and 930.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 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[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 24]: Loop Invariant [2018-12-09 13:00:13,594 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 24]: Loop Invariant [2018-12-09 13:00:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,597 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,597 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,597 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-12-09 13:00:13,597 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && 0 <= P8 + 2147483648) && q == 3) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && q == 1) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && q == 4) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 19.4s OverallTime, 25 OverallIterations, 14 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 4868 SDtfs, 3639 SDslu, 26546 SDs, 0 SdLazy, 3565 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1536 GetRequests, 1303 SyntacticMatches, 27 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 98 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 49 NumberOfFragments, 203 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3029 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 783 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 2852 NumberOfCodeBlocks, 2768 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2811 ConstructedInterpolants, 42 QuantifiedInterpolants, 2653149 SizeOfPredicates, 58 NumberOfNonLiveVariables, 8173 ConjunctsInSsa, 452 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 1038/4848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...