./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i --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_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fc86a08ff37d05adddb13279399a852f6ece83c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:12:33,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:12:33,844 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:12:33,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:12:33,851 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:12:33,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:12:33,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:12:33,853 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:12:33,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:12:33,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:12:33,855 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:12:33,855 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:12:33,856 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:12:33,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:12:33,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:12:33,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:12:33,857 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:12:33,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:12:33,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:12:33,860 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:12:33,861 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:12:33,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:12:33,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:12:33,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:12:33,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:12:33,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:12:33,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:12:33,865 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:12:33,866 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:12:33,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:12:33,866 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:12:33,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:12:33,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:12:33,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:12:33,867 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:12:33,868 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:12:33,868 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 02:12:33,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:12:33,877 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:12:33,878 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:12:33,878 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:12:33,878 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 02:12:33,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 02:12:33,879 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 02:12:33,879 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 02:12:33,879 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 02:12:33,879 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 02:12:33,879 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 02:12:33,880 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 02:12:33,880 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 02:12:33,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:12:33,880 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:12:33,881 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:12:33,881 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:12:33,881 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:12:33,881 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:12:33,881 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:12:33,881 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:12:33,881 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:12:33,882 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:12:33,882 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:12:33,882 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:12:33,882 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:12:33,882 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:12:33,882 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:12:33,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:12:33,883 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:12:33,883 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:12:33,883 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:12:33,883 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 02:12:33,883 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:12:33,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:12:33,884 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 02:12:33,884 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fc86a08ff37d05adddb13279399a852f6ece83c [2018-12-02 02:12:33,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:12:33,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:12:33,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:12:33,917 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:12:33,917 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:12:33,917 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-12-02 02:12:33,953 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/data/2aa3cf14a/bd848700b17b49b0ade5a3a8129871a4/FLAG349624c47 [2018-12-02 02:12:34,294 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:12:34,295 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/sv-benchmarks/c/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-12-02 02:12:34,298 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/data/2aa3cf14a/bd848700b17b49b0ade5a3a8129871a4/FLAG349624c47 [2018-12-02 02:12:34,695 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/data/2aa3cf14a/bd848700b17b49b0ade5a3a8129871a4 [2018-12-02 02:12:34,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:12:34,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:12:34,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:12:34,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:12:34,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:12:34,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fef4084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34, skipping insertion in model container [2018-12-02 02:12:34,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:12:34,722 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:12:34,810 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:12:34,812 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:12:34,824 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:12:34,832 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:12:34,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34 WrapperNode [2018-12-02 02:12:34,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:12:34,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:12:34,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:12:34,833 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:12:34,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:12:34,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:12:34,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:12:34,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:12:34,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... [2018-12-02 02:12:34,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:12:34,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:12:34,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:12:34,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:12:34,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:12:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:12:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:12:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:12:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:12:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:12:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:12:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 02:12:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 02:12:35,042 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:12:35,042 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 02:12:35,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:35 BoogieIcfgContainer [2018-12-02 02:12:35,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:12:35,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:12:35,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:12:35,045 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:12:35,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:12:34" (1/3) ... [2018-12-02 02:12:35,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12636bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:12:35, skipping insertion in model container [2018-12-02 02:12:35,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:12:34" (2/3) ... [2018-12-02 02:12:35,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12636bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:12:35, skipping insertion in model container [2018-12-02 02:12:35,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:35" (3/3) ... [2018-12-02 02:12:35,047 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-12-02 02:12:35,053 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:12:35,057 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 02:12:35,065 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 02:12:35,082 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:12:35,082 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:12:35,082 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:12:35,082 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:12:35,082 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:12:35,082 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:12:35,082 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:12:35,082 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:12:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-12-02 02:12:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 02:12:35,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:35,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:12:35,097 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:35,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2018-12-02 02:12:35,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:35,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:35,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:35,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:35,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:35,214 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-02 02:12:35,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:12:35,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:12:35,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:35,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:12:35,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:12:35,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:12:35,227 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2018-12-02 02:12:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:35,290 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-12-02 02:12:35,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:12:35,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 02:12:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:35,300 INFO L225 Difference]: With dead ends: 83 [2018-12-02 02:12:35,300 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 02:12:35,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:12:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 02:12:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 02:12:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 02:12:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2018-12-02 02:12:35,333 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2018-12-02 02:12:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:35,333 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2018-12-02 02:12:35,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:12:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2018-12-02 02:12:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 02:12:35,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:35,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:12:35,334 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:35,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2018-12-02 02:12:35,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:35,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:35,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:35,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:35,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:35,362 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-02 02:12:35,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:12:35,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:12:35,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:35,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:12:35,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:12:35,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:12:35,364 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2018-12-02 02:12:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:35,422 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2018-12-02 02:12:35,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:12:35,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 02:12:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:35,423 INFO L225 Difference]: With dead ends: 49 [2018-12-02 02:12:35,423 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 02:12:35,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:12:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 02:12:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-02 02:12:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 02:12:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2018-12-02 02:12:35,429 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2018-12-02 02:12:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:35,429 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2018-12-02 02:12:35,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:12:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2018-12-02 02:12:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 02:12:35,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:35,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:12:35,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:35,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2018-12-02 02:12:35,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:35,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:35,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:35,465 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-02 02:12:35,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:12:35,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:12:35,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:35,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:12:35,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:12:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:12:35,466 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2018-12-02 02:12:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:35,561 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2018-12-02 02:12:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:12:35,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-02 02:12:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:35,562 INFO L225 Difference]: With dead ends: 79 [2018-12-02 02:12:35,562 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 02:12:35,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 02:12:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 02:12:35,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-12-02 02:12:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 02:12:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2018-12-02 02:12:35,571 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2018-12-02 02:12:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:35,572 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2018-12-02 02:12:35,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:12:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2018-12-02 02:12:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 02:12:35,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:35,573 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-02 02:12:35,573 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:35,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:35,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2018-12-02 02:12:35,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:35,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:35,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:35,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:35,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:12:35,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:35,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:35,620 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-02 02:12:35,621 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [29], [67], [82], [85], [87], [90], [92], [93], [94], [95], [117], [118], [119] [2018-12-02 02:12:35,643 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:35,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:35,726 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:35,727 INFO L272 AbstractInterpreter]: Visited 18 different actions 23 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 8. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2018-12-02 02:12:35,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:35,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:35,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:35,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:35,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:35,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:35,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 02:12:35,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:35,902 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-02 02:12:35,916 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:12:35,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 15 [2018-12-02 02:12:35,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:35,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:12:35,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:12:35,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-02 02:12:35,917 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 5 states. [2018-12-02 02:12:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:36,429 INFO L93 Difference]: Finished difference Result 218 states and 345 transitions. [2018-12-02 02:12:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:12:36,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-02 02:12:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:36,432 INFO L225 Difference]: With dead ends: 218 [2018-12-02 02:12:36,432 INFO L226 Difference]: Without dead ends: 153 [2018-12-02 02:12:36,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:12:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-02 02:12:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 115. [2018-12-02 02:12:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 02:12:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 180 transitions. [2018-12-02 02:12:36,459 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 180 transitions. Word has length 19 [2018-12-02 02:12:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:36,459 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 180 transitions. [2018-12-02 02:12:36,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:12:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 180 transitions. [2018-12-02 02:12:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 02:12:36,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:36,460 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-02 02:12:36,460 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:36,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2018-12-02 02:12:36,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:36,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:36,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:36,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:36,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:12:36,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:36,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:36,500 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-02 02:12:36,500 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99] [2018-12-02 02:12:36,501 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:36,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:36,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:36,518 INFO L272 AbstractInterpreter]: Visited 18 different actions 23 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 8. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2018-12-02 02:12:36,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:36,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:36,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:36,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:36,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:36,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:36,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:36,575 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-02 02:12:36,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:36,588 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-02 02:12:36,602 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:12:36,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 10 [2018-12-02 02:12:36,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:36,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:12:36,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:12:36,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:12:36,603 INFO L87 Difference]: Start difference. First operand 115 states and 180 transitions. Second operand 6 states. [2018-12-02 02:12:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:36,724 INFO L93 Difference]: Finished difference Result 176 states and 280 transitions. [2018-12-02 02:12:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:12:36,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 02:12:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:36,726 INFO L225 Difference]: With dead ends: 176 [2018-12-02 02:12:36,726 INFO L226 Difference]: Without dead ends: 174 [2018-12-02 02:12:36,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:12:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-02 02:12:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 151. [2018-12-02 02:12:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-02 02:12:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 243 transitions. [2018-12-02 02:12:36,759 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 243 transitions. Word has length 19 [2018-12-02 02:12:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:36,759 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 243 transitions. [2018-12-02 02:12:36,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:12:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 243 transitions. [2018-12-02 02:12:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 02:12:36,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:36,760 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-02 02:12:36,760 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:36,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2018-12-02 02:12:36,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:36,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:36,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:36,776 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-02 02:12:36,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:12:36,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:12:36,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:36,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:12:36,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:12:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:12:36,778 INFO L87 Difference]: Start difference. First operand 151 states and 243 transitions. Second operand 3 states. [2018-12-02 02:12:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:36,807 INFO L93 Difference]: Finished difference Result 199 states and 311 transitions. [2018-12-02 02:12:36,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:12:36,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 02:12:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:36,810 INFO L225 Difference]: With dead ends: 199 [2018-12-02 02:12:36,810 INFO L226 Difference]: Without dead ends: 148 [2018-12-02 02:12:36,811 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-02 02:12:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-02 02:12:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-02 02:12:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-02 02:12:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 236 transitions. [2018-12-02 02:12:36,836 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 236 transitions. Word has length 19 [2018-12-02 02:12:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:36,837 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 236 transitions. [2018-12-02 02:12:36,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:12:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 236 transitions. [2018-12-02 02:12:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 02:12:36,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:36,838 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:12:36,838 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:36,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2018-12-02 02:12:36,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:36,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:36,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:12:36,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:36,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:36,891 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-02 02:12:36,891 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [47], [51], [56], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109] [2018-12-02 02:12:36,892 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:36,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:36,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:36,913 INFO L272 AbstractInterpreter]: Visited 22 different actions 32 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 8. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 14 variables. [2018-12-02 02:12:36,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:36,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:36,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:36,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:36,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:36,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:36,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 02:12:36,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:36,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 02:12:36,986 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:12:36,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-12-02 02:12:36,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:36,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:12:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:12:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:12:36,987 INFO L87 Difference]: Start difference. First operand 148 states and 236 transitions. Second operand 6 states. [2018-12-02 02:12:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:37,095 INFO L93 Difference]: Finished difference Result 213 states and 346 transitions. [2018-12-02 02:12:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:12:37,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-02 02:12:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:37,096 INFO L225 Difference]: With dead ends: 213 [2018-12-02 02:12:37,096 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 02:12:37,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:12:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 02:12:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 187. [2018-12-02 02:12:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-02 02:12:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 303 transitions. [2018-12-02 02:12:37,115 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 303 transitions. Word has length 26 [2018-12-02 02:12:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:37,116 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 303 transitions. [2018-12-02 02:12:37,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:12:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 303 transitions. [2018-12-02 02:12:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:12:37,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:37,117 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:12:37,117 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:37,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash -773325175, now seen corresponding path program 1 times [2018-12-02 02:12:37,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:37,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:37,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:12:37,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:37,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:37,163 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-02 02:12:37,163 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103] [2018-12-02 02:12:37,164 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:37,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:37,186 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:37,186 INFO L272 AbstractInterpreter]: Visited 22 different actions 37 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 8. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 13 variables. [2018-12-02 02:12:37,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:37,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:37,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:37,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:37,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:37,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:37,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 02:12:37,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 02:12:37,265 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:12:37,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-12-02 02:12:37,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:37,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:12:37,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:12:37,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:12:37,266 INFO L87 Difference]: Start difference. First operand 187 states and 303 transitions. Second operand 6 states. [2018-12-02 02:12:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:37,379 INFO L93 Difference]: Finished difference Result 259 states and 417 transitions. [2018-12-02 02:12:37,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:12:37,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-12-02 02:12:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:37,380 INFO L225 Difference]: With dead ends: 259 [2018-12-02 02:12:37,380 INFO L226 Difference]: Without dead ends: 257 [2018-12-02 02:12:37,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:12:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-02 02:12:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 237. [2018-12-02 02:12:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-02 02:12:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 387 transitions. [2018-12-02 02:12:37,399 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 387 transitions. Word has length 29 [2018-12-02 02:12:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:37,399 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 387 transitions. [2018-12-02 02:12:37,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:12:37,399 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 387 transitions. [2018-12-02 02:12:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 02:12:37,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:37,400 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:12:37,400 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:37,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:37,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2018-12-02 02:12:37,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:37,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:37,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:37,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:37,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:12:37,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:37,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:37,455 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-02 02:12:37,455 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [47], [51], [56], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109], [110], [111] [2018-12-02 02:12:37,456 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:37,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:37,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:37,478 INFO L272 AbstractInterpreter]: Visited 24 different actions 39 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 8. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 14 variables. [2018-12-02 02:12:37,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:37,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:37,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:37,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:37,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:37,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:37,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:12:37,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:12:37,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:12:37,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2018-12-02 02:12:37,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:12:37,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 02:12:37,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 02:12:37,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:12:37,668 INFO L87 Difference]: Start difference. First operand 237 states and 387 transitions. Second operand 14 states. [2018-12-02 02:12:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:38,217 INFO L93 Difference]: Finished difference Result 428 states and 707 transitions. [2018-12-02 02:12:38,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:12:38,218 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-12-02 02:12:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:38,220 INFO L225 Difference]: With dead ends: 428 [2018-12-02 02:12:38,220 INFO L226 Difference]: Without dead ends: 426 [2018-12-02 02:12:38,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-12-02 02:12:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-12-02 02:12:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 377. [2018-12-02 02:12:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-12-02 02:12:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 627 transitions. [2018-12-02 02:12:38,249 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 627 transitions. Word has length 31 [2018-12-02 02:12:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:38,249 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 627 transitions. [2018-12-02 02:12:38,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 02:12:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 627 transitions. [2018-12-02 02:12:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 02:12:38,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:38,250 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:12:38,251 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:38,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1955682911, now seen corresponding path program 1 times [2018-12-02 02:12:38,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:38,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:38,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 02:12:38,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:38,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:38,299 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-02 02:12:38,299 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [13], [22], [31], [47], [51], [56], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109], [110], [111] [2018-12-02 02:12:38,300 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:38,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:38,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:38,314 INFO L272 AbstractInterpreter]: Visited 24 different actions 39 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 8. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 14 variables. [2018-12-02 02:12:38,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:38,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:38,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:38,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:38,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:38,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:38,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 02:12:38,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 02:12:38,447 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:12:38,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [9] total 17 [2018-12-02 02:12:38,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:38,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 02:12:38,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 02:12:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:12:38,448 INFO L87 Difference]: Start difference. First operand 377 states and 627 transitions. Second operand 8 states. [2018-12-02 02:12:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:38,626 INFO L93 Difference]: Finished difference Result 412 states and 669 transitions. [2018-12-02 02:12:38,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:12:38,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-12-02 02:12:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:38,628 INFO L225 Difference]: With dead ends: 412 [2018-12-02 02:12:38,629 INFO L226 Difference]: Without dead ends: 410 [2018-12-02 02:12:38,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-12-02 02:12:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-02 02:12:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 391. [2018-12-02 02:12:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-02 02:12:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 640 transitions. [2018-12-02 02:12:38,662 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 640 transitions. Word has length 31 [2018-12-02 02:12:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:38,662 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 640 transitions. [2018-12-02 02:12:38,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 02:12:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 640 transitions. [2018-12-02 02:12:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 02:12:38,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:38,664 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 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-02 02:12:38,664 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:38,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:38,664 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2018-12-02 02:12:38,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:38,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:38,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:38,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:38,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 02:12:38,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:38,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:38,710 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-02 02:12:38,710 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [39], [42], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107] [2018-12-02 02:12:38,711 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:38,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:38,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:38,728 INFO L272 AbstractInterpreter]: Visited 28 different actions 53 times. Never merged. Never widened. Performed 96 root evaluator evaluations with a maximum evaluation depth of 8. Performed 96 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 14 variables. [2018-12-02 02:12:38,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:38,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:38,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:38,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:38,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:38,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:38,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 02:12:38,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 02:12:38,804 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:12:38,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-12-02 02:12:38,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:38,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:12:38,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:12:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:12:38,805 INFO L87 Difference]: Start difference. First operand 391 states and 640 transitions. Second operand 7 states. [2018-12-02 02:12:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:38,953 INFO L93 Difference]: Finished difference Result 448 states and 720 transitions. [2018-12-02 02:12:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:12:38,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-02 02:12:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:38,955 INFO L225 Difference]: With dead ends: 448 [2018-12-02 02:12:38,955 INFO L226 Difference]: Without dead ends: 446 [2018-12-02 02:12:38,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:12:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-02 02:12:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 320. [2018-12-02 02:12:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-02 02:12:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 508 transitions. [2018-12-02 02:12:38,984 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 508 transitions. Word has length 41 [2018-12-02 02:12:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:38,984 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 508 transitions. [2018-12-02 02:12:38,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:12:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 508 transitions. [2018-12-02 02:12:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 02:12:38,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:38,985 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 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-02 02:12:38,985 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:38,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:38,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233346, now seen corresponding path program 1 times [2018-12-02 02:12:38,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:38,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:38,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 02:12:39,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:39,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:39,035 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-02 02:12:39,035 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [47], [51], [54], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [97], [105], [106], [107], [108], [117], [118], [119], [120] [2018-12-02 02:12:39,035 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:39,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:39,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:39,049 INFO L272 AbstractInterpreter]: Visited 29 different actions 49 times. Never merged. Never widened. Performed 92 root evaluator evaluations with a maximum evaluation depth of 8. Performed 92 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-12-02 02:12:39,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:39,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:39,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:39,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:39,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:39,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:39,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 02:12:39,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 02:12:39,146 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:12:39,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 11 [2018-12-02 02:12:39,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:39,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:12:39,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:12:39,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:12:39,147 INFO L87 Difference]: Start difference. First operand 320 states and 508 transitions. Second operand 7 states. [2018-12-02 02:12:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:39,252 INFO L93 Difference]: Finished difference Result 327 states and 514 transitions. [2018-12-02 02:12:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 02:12:39,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-02 02:12:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:39,254 INFO L225 Difference]: With dead ends: 327 [2018-12-02 02:12:39,255 INFO L226 Difference]: Without dead ends: 325 [2018-12-02 02:12:39,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-02 02:12:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-02 02:12:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 324. [2018-12-02 02:12:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-02 02:12:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 511 transitions. [2018-12-02 02:12:39,284 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 511 transitions. Word has length 41 [2018-12-02 02:12:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:39,285 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 511 transitions. [2018-12-02 02:12:39,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:12:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 511 transitions. [2018-12-02 02:12:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 02:12:39,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:39,286 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2018-12-02 02:12:39,286 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:39,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1768387788, now seen corresponding path program 1 times [2018-12-02 02:12:39,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:39,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:39,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:39,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:39,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-02 02:12:39,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:39,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:39,320 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-02 02:12:39,320 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [47], [51], [54], [56], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109], [117], [118], [119], [120] [2018-12-02 02:12:39,321 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:39,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:39,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:39,335 INFO L272 AbstractInterpreter]: Visited 29 different actions 49 times. Never merged. Never widened. Performed 92 root evaluator evaluations with a maximum evaluation depth of 8. Performed 92 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-12-02 02:12:39,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:39,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:39,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:39,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:39,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:39,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:39,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 02:12:39,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-02 02:12:39,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:12:39,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2018-12-02 02:12:39,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:12:39,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 02:12:39,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 02:12:39,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:12:39,604 INFO L87 Difference]: Start difference. First operand 324 states and 511 transitions. Second operand 12 states. [2018-12-02 02:12:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:40,607 INFO L93 Difference]: Finished difference Result 507 states and 780 transitions. [2018-12-02 02:12:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:12:40,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-12-02 02:12:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:40,608 INFO L225 Difference]: With dead ends: 507 [2018-12-02 02:12:40,608 INFO L226 Difference]: Without dead ends: 158 [2018-12-02 02:12:40,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-12-02 02:12:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-02 02:12:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2018-12-02 02:12:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-02 02:12:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 216 transitions. [2018-12-02 02:12:40,625 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 216 transitions. Word has length 53 [2018-12-02 02:12:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:40,625 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 216 transitions. [2018-12-02 02:12:40,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 02:12:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 216 transitions. [2018-12-02 02:12:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 02:12:40,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:40,626 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 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] [2018-12-02 02:12:40,626 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:40,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1118864811, now seen corresponding path program 1 times [2018-12-02 02:12:40,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:40,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:40,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:40,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:40,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 02:12:40,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:40,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:40,654 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-12-02 02:12:40,654 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [47], [51], [56], [61], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116] [2018-12-02 02:12:40,655 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:40,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:40,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:40,670 INFO L272 AbstractInterpreter]: Visited 30 different actions 55 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 8. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2018-12-02 02:12:40,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:40,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:40,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:40,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:40,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:40,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:40,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-02 02:12:40,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 02:12:40,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:12:40,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2018-12-02 02:12:40,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 02:12:40,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:12:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:12:40,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-02 02:12:40,794 INFO L87 Difference]: Start difference. First operand 149 states and 216 transitions. Second operand 6 states. [2018-12-02 02:12:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:40,930 INFO L93 Difference]: Finished difference Result 292 states and 430 transitions. [2018-12-02 02:12:40,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:12:40,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 02:12:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:40,932 INFO L225 Difference]: With dead ends: 292 [2018-12-02 02:12:40,932 INFO L226 Difference]: Without dead ends: 181 [2018-12-02 02:12:40,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-02 02:12:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-02 02:12:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2018-12-02 02:12:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-02 02:12:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 246 transitions. [2018-12-02 02:12:40,961 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 246 transitions. Word has length 66 [2018-12-02 02:12:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:40,961 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 246 transitions. [2018-12-02 02:12:40,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:12:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 246 transitions. [2018-12-02 02:12:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 02:12:40,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:12:40,962 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 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] [2018-12-02 02:12:40,962 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:12:40,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2023812105, now seen corresponding path program 1 times [2018-12-02 02:12:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 02:12:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:40,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:12:40,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 02:12:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 25 proven. 45 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-02 02:12:41,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:41,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 02:12:41,034 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2018-12-02 02:12:41,035 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [39], [42], [47], [51], [56], [61], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116] [2018-12-02 02:12:41,035 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 02:12:41,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 02:12:41,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 02:12:41,075 INFO L272 AbstractInterpreter]: Visited 41 different actions 131 times. Merged at 9 different actions 9 times. Never widened. Performed 220 root evaluator evaluations with a maximum evaluation depth of 8. Performed 220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 2 fixpoints after 1 different actions. Largest state had 15 variables. [2018-12-02 02:12:41,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:12:41,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 02:12:41,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:12:41,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 02:12:41,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:12:41,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 02:12:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:12:41,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:12:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-02 02:12:41,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 02:12:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-02 02:12:41,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 02:12:41,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2018-12-02 02:12:41,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 02:12:41,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 02:12:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 02:12:41,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-12-02 02:12:41,332 INFO L87 Difference]: Start difference. First operand 166 states and 246 transitions. Second operand 16 states. [2018-12-02 02:12:41,902 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-12-02 02:12:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:12:43,888 INFO L93 Difference]: Finished difference Result 245 states and 359 transitions. [2018-12-02 02:12:43,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-02 02:12:43,888 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2018-12-02 02:12:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:12:43,889 INFO L225 Difference]: With dead ends: 245 [2018-12-02 02:12:43,889 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 02:12:43,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=672, Invalid=2297, Unknown=1, NotChecked=0, Total=2970 [2018-12-02 02:12:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 02:12:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 02:12:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 02:12:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 02:12:43,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2018-12-02 02:12:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:12:43,890 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:12:43,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 02:12:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:12:43,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 02:12:43,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 02:12:43,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:43,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 02:12:44,513 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-12-02 02:12:44,684 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-12-02 02:12:44,830 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 31 [2018-12-02 02:12:45,000 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-12-02 02:12:45,121 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 26 [2018-12-02 02:12:45,326 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2018-12-02 02:12:45,534 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2018-12-02 02:12:45,696 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 41 [2018-12-02 02:12:45,854 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-12-02 02:12:46,010 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-12-02 02:12:46,259 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-12-02 02:12:46,460 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2018-12-02 02:12:46,657 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 02:12:46,657 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 02:12:46,657 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 02:12:46,657 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 02:12:46,657 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 02:12:46,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 02:12:46,658 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse2 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2))))) (.cse3 (<= (* 2 main_~l~0) main_~j~0)) (.cse6 (<= 1 main_~l~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse4 (<= 1 main_~i~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 .cse5 (< 0 main_~l~0)) (and .cse6 .cse0 .cse1 .cse2 .cse3 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0))) .cse4 .cse5) (and .cse6 (<= main_~l~0 1) .cse1 .cse4 .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)))) [2018-12-02 02:12:46,658 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-12-02 02:12:46,658 INFO L444 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (and (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2)))) (< 0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)) [2018-12-02 02:12:46,658 INFO L444 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse2 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2))))) (.cse3 (<= (* 2 main_~l~0) main_~j~0)) (.cse6 (<= 1 main_~l~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse4 (<= 1 main_~i~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 .cse5 (< 0 main_~l~0)) (and .cse6 .cse0 .cse1 .cse2 .cse3 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0))) .cse4 .cse5) (and .cse6 (<= main_~l~0 1) .cse1 .cse4 .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)))) [2018-12-02 02:12:46,658 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 44) the Hoare annotation is: (let ((.cse3 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse4 (<= main_~i~0 main_~n~0)) (.cse1 (<= main_~r~0 main_~n~0)) (.cse0 (<= (* 2 main_~l~0) main_~j~0)) (.cse5 (<= 1 main_~i~0)) (.cse2 (< 0 main_~l~0))) (or (and .cse0 (<= main_~i~0 (div main_~n~0 2)) (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse1 .cse2 .cse3) (and .cse4 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse0 .cse5 .cse1 .cse2 .cse3) (and (<= 1 main_~l~0) .cse5 .cse4 .cse1 .cse0 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0)))) (and (<= main_~l~0 1) (<= (+ main_~r~0 1) main_~n~0) .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse2 (<= 2 main_~r~0)))) [2018-12-02 02:12:46,658 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 21 54) no Hoare annotation was computed. [2018-12-02 02:12:46,658 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-12-02 02:12:46,658 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-12-02 02:12:46,658 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-12-02 02:12:46,658 INFO L444 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse3 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse4 (< 0 main_~l~0)) (.cse5 (<= main_~i~0 main_~n~0)) (.cse0 (<= main_~j~0 main_~n~0)) (.cse1 (<= (* 2 main_~l~0) main_~j~0)) (.cse6 (<= 1 main_~i~0)) (.cse2 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse2 .cse3 .cse4) (and .cse5 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse0 .cse1 .cse6 .cse2 .cse3 .cse4) (and (<= 1 main_~l~0) .cse5 .cse0 .cse1 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0))) .cse6 .cse2))) [2018-12-02 02:12:46,658 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-12-02 02:12:46,659 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-12-02 02:12:46,659 INFO L444 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse3 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse4 (< 0 main_~l~0)) (.cse5 (<= main_~i~0 main_~n~0)) (.cse0 (<= main_~j~0 main_~n~0)) (.cse1 (<= (* 2 main_~l~0) main_~j~0)) (.cse6 (<= 1 main_~i~0)) (.cse2 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse2 .cse3 .cse4) (and .cse5 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse0 .cse1 .cse6 .cse2 .cse3 .cse4) (and (<= 1 main_~l~0) .cse5 .cse0 .cse1 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0))) .cse6 .cse2))) [2018-12-02 02:12:46,659 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 54) no Hoare annotation was computed. [2018-12-02 02:12:46,659 INFO L444 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~i~0) (<= 1 main_~l~0) (<= main_~l~0 1) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-12-02 02:12:46,659 INFO L444 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~i~0) (<= 1 main_~l~0) (<= main_~l~0 1) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-12-02 02:12:46,659 INFO L444 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (and (<= 1 main_~i~0) (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2)))) (<= 2 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (.cse1 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 (<= main_~j~0 main_~n~0)) (and .cse0 (<= main_~i~0 main_~n~0) .cse1))) [2018-12-02 02:12:46,659 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-12-02 02:12:46,659 INFO L444 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (<= main_~r~0 main_~n~0)) (.cse1 (and (<= 1 main_~i~0) (and (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2)))) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0)) (<= 2 main_~l~0) (<= (* 2 main_~l~0) main_~j~0)))) (or (and (<= main_~i~0 main_~n~0) .cse0 .cse1) (and .cse0 (<= main_~j~0 main_~n~0) .cse1))) [2018-12-02 02:12:46,659 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-12-02 02:12:46,659 INFO L444 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse3 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse4 (< 0 main_~l~0)) (.cse5 (<= main_~i~0 main_~n~0)) (.cse0 (<= main_~j~0 main_~n~0)) (.cse1 (<= (* 2 main_~l~0) main_~j~0)) (.cse6 (<= 1 main_~i~0)) (.cse2 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse2 .cse3 .cse4) (and .cse5 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse0 .cse1 .cse6 .cse2 .cse3 .cse4) (and (<= 1 main_~l~0) .cse5 .cse0 .cse1 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0))) .cse6 .cse2))) [2018-12-02 02:12:46,659 INFO L444 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse3 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse4 (< 0 main_~l~0)) (.cse5 (<= main_~i~0 main_~n~0)) (.cse0 (<= main_~j~0 main_~n~0)) (.cse1 (<= (* 2 main_~l~0) main_~j~0)) (.cse6 (<= 1 main_~i~0)) (.cse2 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse2 .cse3 .cse4) (and .cse5 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse0 .cse1 .cse6 .cse2 .cse3 .cse4) (and (<= 1 main_~l~0) .cse5 .cse0 .cse1 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0))) .cse6 .cse2))) [2018-12-02 02:12:46,659 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-02 02:12:46,659 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-12-02 02:12:46,659 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-12-02 02:12:46,660 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse2 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2))))) (.cse3 (<= (* 2 main_~l~0) main_~j~0)) (.cse6 (<= 1 main_~l~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse4 (<= 1 main_~i~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 .cse5 (< 0 main_~l~0)) (and .cse6 .cse0 .cse1 .cse2 .cse3 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0))) .cse4 .cse5) (and .cse6 (<= main_~l~0 1) .cse1 .cse4 .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)))) [2018-12-02 02:12:46,660 INFO L444 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse2 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2))))) (.cse3 (<= (* 2 main_~l~0) main_~j~0)) (.cse6 (<= 1 main_~l~0)) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse4 (<= 1 main_~i~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 .cse5 (< 0 main_~l~0)) (and .cse6 .cse0 .cse1 .cse2 .cse3 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0))) .cse4 .cse5) (and .cse6 (<= main_~l~0 1) .cse1 .cse4 .cse5 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= 2 main_~r~0)))) [2018-12-02 02:12:46,660 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-12-02 02:12:46,660 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-12-02 02:12:46,660 INFO L444 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse5 (exists ((main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~l~0 (div main_~n~0 2))))) (.cse6 (< 0 main_~l~0)) (.cse0 (<= main_~i~0 main_~n~0)) (.cse1 (<= main_~j~0 main_~n~0)) (.cse2 (<= (* 2 main_~l~0) main_~j~0)) (.cse3 (<= 1 main_~i~0)) (.cse4 (<= main_~r~0 main_~n~0))) (or (and .cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 (<= (* 2 main_~i~0) main_~j~0) (< 0 main_~i~0) .cse4 .cse5 .cse6) (and .cse0 (and (<= 1 main_~l~0) .cse1 .cse2 (exists ((v_main_~l~0_32 Int)) (and (<= (+ main_~l~0 1) v_main_~l~0_32) (<= (* 2 v_main_~l~0_32) main_~r~0))) .cse3 .cse4)))) [2018-12-02 02:12:46,660 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-12-02 02:12:46,660 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-12-02 02:12:46,660 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-12-02 02:12:46,660 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-12-02 02:12:46,660 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-12-02 02:12:46,660 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-12-02 02:12:46,660 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-12-02 02:12:46,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] [2018-12-02 02:12:46,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] [2018-12-02 02:12:46,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] [2018-12-02 02:12:46,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] [2018-12-02 02:12:46,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:12:46 BoogieIcfgContainer [2018-12-02 02:12:46,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:12:46,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:12:46,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:12:46,677 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:12:46,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:12:35" (3/4) ... [2018-12-02 02:12:46,680 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 02:12:46,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 02:12:46,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 02:12:46,685 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 02:12:46,689 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-02 02:12:46,689 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 02:12:46,689 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 02:12:46,689 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 02:12:46,711 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 * l <= j && i <= n / 2) && 2 * i <= j) && 0 < i) && r <= n) && 0 < l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2)) || ((((((i <= n && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && 2 * l <= j) && 1 <= i) && r <= n) && 0 < l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2))) || (((((1 <= l && 1 <= i) && i <= n) && r <= n) && 2 * l <= j) && (\exists v_main_~l~0_32 : int :: l + 1 <= v_main_~l~0_32 && 2 * v_main_~l~0_32 <= r))) || (((((l <= 1 && r + 1 <= n) && 1 <= i) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && 0 < l) && 2 <= r) [2018-12-02 02:12:46,724 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_33bd8e2f-18ea-46d1-a880-8a0e696eaed8/bin-2019/utaipan/witness.graphml [2018-12-02 02:12:46,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:12:46,725 INFO L168 Benchmark]: Toolchain (without parser) took 12026.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -207.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:46,725 INFO L168 Benchmark]: CDTParser took 0.11 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-02 02:12:46,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.87 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:46,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.57 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:12:46,726 INFO L168 Benchmark]: Boogie Preprocessor took 13.61 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:46,726 INFO L168 Benchmark]: RCFGBuilder took 183.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:46,726 INFO L168 Benchmark]: TraceAbstraction took 11633.02 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.7 MB). Peak memory consumption was 394.2 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:46,726 INFO L168 Benchmark]: Witness Printer took 48.06 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:12:46,728 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 130.87 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.57 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.61 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 183.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11633.02 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.7 MB). Peak memory consumption was 394.2 MB. Max. memory is 11.5 GB. * Witness Printer took 48.06 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 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_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-12-02 02:12:46,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] [2018-12-02 02:12:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] [2018-12-02 02:12:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~l~0_32,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-12-02 02:12:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] Derived loop invariant: ((((((((2 * l <= j && i <= n / 2) && 2 * i <= j) && 0 < i) && r <= n) && 0 < l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2)) || ((((((i <= n && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && 2 * l <= j) && 1 <= i) && r <= n) && 0 < l) && (\exists main_~n~0 : int :: ((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && l <= main_~n~0 / 2))) || (((((1 <= l && 1 <= i) && i <= n) && r <= n) && 2 * l <= j) && (\exists v_main_~l~0_32 : int :: l + 1 <= v_main_~l~0_32 && 2 * v_main_~l~0_32 <= r))) || (((((l <= 1 && r + 1 <= n) && 1 <= i) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && 0 < l) && 2 <= r) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. SAFE Result, 11.5s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 928 SDtfs, 627 SDslu, 3001 SDs, 0 SdLazy, 3437 SolverSat, 1124 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1077 GetRequests, 849 SyntacticMatches, 19 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 11 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 330 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 390 PreInvPairs, 598 NumberOfFragments, 1588 HoareAnnotationTreeSize, 390 FomulaSimplifications, 2928212 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 20 FomulaSimplificationsInter, 96631 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1356 ConstructedInterpolants, 74 QuantifiedInterpolants, 192542 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1080 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 37 InterpolantComputations, 19 PerfectInterpolantSequences, 2094/2240 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...