./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 0c292d0c9d9c055df9398b3303a92d6621b60758 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 23:48:46,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:48:46,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:48:46,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:48:46,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:48:46,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:48:46,579 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:48:46,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:48:46,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:48:46,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:48:46,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:48:46,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:48:46,583 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:48:46,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:48:46,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:48:46,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:48:46,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:48:46,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:48:46,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:48:46,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:48:46,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:48:46,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:48:46,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:48:46,594 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:48:46,594 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:48:46,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:48:46,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:48:46,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:48:46,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:48:46,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:48:46,597 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:48:46,598 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:48:46,598 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:48:46,598 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:48:46,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:48:46,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:48:46,599 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 23:48:46,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:48:46,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:48:46,611 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:48:46,611 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:48:46,611 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 23:48:46,611 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 23:48:46,611 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 23:48:46,611 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 23:48:46,611 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 23:48:46,612 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 23:48:46,612 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 23:48:46,612 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 23:48:46,612 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 23:48:46,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:48:46,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:48:46,612 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:48:46,613 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:48:46,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:48:46,613 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:48:46,613 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:48:46,613 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:48:46,613 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:48:46,613 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:48:46,613 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:48:46,614 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:48:46,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:48:46,614 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 23:48:46,615 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_58f36447-17db-4b92-bc6d-f725430c02af/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 -> 0c292d0c9d9c055df9398b3303a92d6621b60758 [2018-12-02 23:48:46,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:48:46,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:48:46,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:48:46,650 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:48:46,650 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:48:46,651 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-12-02 23:48:46,692 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/data/901540fb5/cb3bb427e2794884a6a99bcee69ba1f0/FLAGcea8725fa [2018-12-02 23:48:47,071 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:48:47,071 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-12-02 23:48:47,074 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/data/901540fb5/cb3bb427e2794884a6a99bcee69ba1f0/FLAGcea8725fa [2018-12-02 23:48:47,082 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/data/901540fb5/cb3bb427e2794884a6a99bcee69ba1f0 [2018-12-02 23:48:47,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:48:47,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:48:47,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:48:47,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:48:47,087 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:48:47,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf44b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47, skipping insertion in model container [2018-12-02 23:48:47,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:48:47,102 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:48:47,189 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:48:47,191 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:48:47,199 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:48:47,207 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:48:47,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47 WrapperNode [2018-12-02 23:48:47,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:48:47,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:48:47,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:48:47,208 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:48:47,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:48:47,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:48:47,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:48:47,223 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:48:47,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... [2018-12-02 23:48:47,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:48:47,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:48:47,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:48:47,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:48:47,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 23:48:47,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 23:48:47,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:48:47,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:48:47,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 23:48:47,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 23:48:47,297 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-12-02 23:48:47,297 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-12-02 23:48:47,381 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:48:47,382 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 23:48:47,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:48:47 BoogieIcfgContainer [2018-12-02 23:48:47,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:48:47,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:48:47,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:48:47,385 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:48:47,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:48:47" (1/3) ... [2018-12-02 23:48:47,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fe013d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:48:47, skipping insertion in model container [2018-12-02 23:48:47,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:48:47" (2/3) ... [2018-12-02 23:48:47,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fe013d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:48:47, skipping insertion in model container [2018-12-02 23:48:47,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:48:47" (3/3) ... [2018-12-02 23:48:47,387 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-12-02 23:48:47,393 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:48:47,399 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 23:48:47,410 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 23:48:47,430 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:48:47,430 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:48:47,430 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:48:47,430 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:48:47,430 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:48:47,430 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:48:47,430 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:48:47,431 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:48:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-02 23:48:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 23:48:47,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:47,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:47,446 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:47,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-12-02 23:48:47,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:47,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:47,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:47,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:47,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:47,570 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 23:48:47,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:48:47,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:48:47,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:48:47,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:48:47,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:48:47,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:48:47,583 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-12-02 23:48:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:47,607 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-02 23:48:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:48:47,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 23:48:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:47,613 INFO L225 Difference]: With dead ends: 32 [2018-12-02 23:48:47,613 INFO L226 Difference]: Without dead ends: 18 [2018-12-02 23:48:47,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:48:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-02 23:48:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 23:48:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 23:48:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-02 23:48:47,640 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-12-02 23:48:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:47,640 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-02 23:48:47,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:48:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-02 23:48:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 23:48:47,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:47,641 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:47,641 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:47,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:47,642 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-12-02 23:48:47,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:47,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:47,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:47,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:47,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 23:48:47,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:47,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:48:47,731 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-02 23:48:47,732 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2018-12-02 23:48:47,757 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 23:48:47,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 23:48:47,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 23:48:47,859 INFO L272 AbstractInterpreter]: Visited 17 different actions 57 times. Merged at 5 different actions 21 times. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 3. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 4 variables. [2018-12-02 23:48:47,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:47,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 23:48:47,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:47,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:47,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:47,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 23:48:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:47,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:48:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 23:48:47,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:48:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 23:48:48,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:48:48,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 23:48:48,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:48:48,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:48:48,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:48:48,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:48:48,018 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2018-12-02 23:48:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:48,040 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-02 23:48:48,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:48:48,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-02 23:48:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:48,041 INFO L225 Difference]: With dead ends: 25 [2018-12-02 23:48:48,041 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 23:48:48,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:48:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 23:48:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 23:48:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 23:48:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-02 23:48:48,046 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-12-02 23:48:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:48,047 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 23:48:48,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:48:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-02 23:48:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 23:48:48,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:48,048 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:48,048 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:48,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-12-02 23:48:48,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:48,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:48,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 23:48:48,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:48,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:48:48,142 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:48:48,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:48:48,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:48,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:48,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 23:48:48,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 23:48:48,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 23:48:48,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:48:48,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:48:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 23:48:48,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:48:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 23:48:48,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:48:48,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 23:48:48,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:48:48,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 23:48:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:48:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-02 23:48:48,354 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-12-02 23:48:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:48,379 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-02 23:48:48,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:48:48,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-02 23:48:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:48,380 INFO L225 Difference]: With dead ends: 28 [2018-12-02 23:48:48,380 INFO L226 Difference]: Without dead ends: 24 [2018-12-02 23:48:48,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-02 23:48:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-02 23:48:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-02 23:48:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 23:48:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-02 23:48:48,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-12-02 23:48:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:48,383 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-02 23:48:48,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 23:48:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-02 23:48:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 23:48:48,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:48,384 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:48,384 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:48,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-12-02 23:48:48,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:48:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 23:48:48,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:48,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:48:48,477 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:48:48,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:48:48,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:48,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:48,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 23:48:48,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 23:48:48,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 23:48:48,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:48:48,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:48:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 23:48:48,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:48:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 23:48:48,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:48:48,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 23:48:48,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:48:48,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 23:48:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 23:48:48,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-12-02 23:48:48,718 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-12-02 23:48:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:48,749 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-02 23:48:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:48:48,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-02 23:48:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:48,750 INFO L225 Difference]: With dead ends: 31 [2018-12-02 23:48:48,750 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 23:48:48,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-12-02 23:48:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 23:48:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-02 23:48:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 23:48:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-02 23:48:48,755 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-12-02 23:48:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:48,755 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-02 23:48:48,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 23:48:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-02 23:48:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 23:48:48,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:48,756 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:48,756 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:48,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-12-02 23:48:48,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:48,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:48:48,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:48,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 23:48:48,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:48,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:48:48,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:48:48,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:48:48,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:48,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:48,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:48,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 23:48:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:48,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:48:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 23:48:48,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:48:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 23:48:49,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:48:49,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-02 23:48:49,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:48:49,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 23:48:49,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 23:48:49,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-12-02 23:48:49,212 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-02 23:48:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:49,252 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-12-02 23:48:49,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 23:48:49,252 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-12-02 23:48:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:49,252 INFO L225 Difference]: With dead ends: 34 [2018-12-02 23:48:49,253 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 23:48:49,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-12-02 23:48:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 23:48:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 23:48:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 23:48:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-02 23:48:49,255 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-12-02 23:48:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:49,256 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-02 23:48:49,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 23:48:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-02 23:48:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 23:48:49,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:49,256 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:49,256 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:49,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-12-02 23:48:49,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:49,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:49,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:49,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:49,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 23:48:49,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:49,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:48:49,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:48:49,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:48:49,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:49,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:49,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 23:48:49,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 23:48:49,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 23:48:49,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:48:49,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:48:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 23:48:49,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:48:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 23:48:49,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:48:49,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-02 23:48:49,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:48:49,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 23:48:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 23:48:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-12-02 23:48:49,802 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2018-12-02 23:48:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:49,861 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-02 23:48:49,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 23:48:49,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-12-02 23:48:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:49,862 INFO L225 Difference]: With dead ends: 37 [2018-12-02 23:48:49,862 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 23:48:49,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-12-02 23:48:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 23:48:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 23:48:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 23:48:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-02 23:48:49,866 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-12-02 23:48:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:49,866 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-02 23:48:49,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 23:48:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-02 23:48:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 23:48:49,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:49,867 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:49,867 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:49,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-12-02 23:48:49,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:49,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:48:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:49,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 23:48:50,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:50,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:48:50,006 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:48:50,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:48:50,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:50,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:50,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 23:48:50,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 23:48:50,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 23:48:50,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:48:50,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:48:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 23:48:50,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:48:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 23:48:50,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:48:50,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-02 23:48:50,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:48:50,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 23:48:50,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 23:48:50,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 23:48:50,520 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2018-12-02 23:48:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:50,589 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-12-02 23:48:50,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 23:48:50,589 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-12-02 23:48:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:50,590 INFO L225 Difference]: With dead ends: 40 [2018-12-02 23:48:50,590 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 23:48:50,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 23:48:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 23:48:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-02 23:48:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 23:48:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-02 23:48:50,594 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-12-02 23:48:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:50,594 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-02 23:48:50,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 23:48:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-02 23:48:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 23:48:50,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:50,595 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:50,595 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:50,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-12-02 23:48:50,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:50,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:50,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:48:50,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:50,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 23:48:50,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:50,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:48:50,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:48:50,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:48:50,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:50,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:50,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:50,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 23:48:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:50,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:48:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 23:48:50,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:48:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 23:48:51,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:48:51,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-02 23:48:51,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:48:51,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 23:48:51,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 23:48:51,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 23:48:51,351 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2018-12-02 23:48:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:51,420 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-02 23:48:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 23:48:51,420 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-12-02 23:48:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:51,421 INFO L225 Difference]: With dead ends: 43 [2018-12-02 23:48:51,421 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 23:48:51,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 23:48:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 23:48:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-02 23:48:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 23:48:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-02 23:48:51,425 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-12-02 23:48:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:51,425 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-02 23:48:51,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 23:48:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-02 23:48:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 23:48:51,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:51,426 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:51,426 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:51,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-12-02 23:48:51,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:51,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:51,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:48:51,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:51,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 23:48:51,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:51,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:48:51,628 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:48:51,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:48:51,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:51,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:51,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 23:48:51,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 23:48:51,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 23:48:51,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:48:51,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:48:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 23:48:51,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:48:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 23:48:52,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:48:52,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-02 23:48:52,402 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:48:52,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 23:48:52,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 23:48:52,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 23:48:52,402 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2018-12-02 23:48:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:52,496 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-12-02 23:48:52,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 23:48:52,497 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-12-02 23:48:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:52,498 INFO L225 Difference]: With dead ends: 46 [2018-12-02 23:48:52,498 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 23:48:52,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 23:48:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 23:48:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 23:48:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 23:48:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-02 23:48:52,503 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-12-02 23:48:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:52,503 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-02 23:48:52,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 23:48:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-02 23:48:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 23:48:52,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:52,504 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:52,504 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:52,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-12-02 23:48:52,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:52,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:52,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:48:52,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:52,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:48:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 23:48:52,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:52,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 23:48:52,708 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 23:48:52,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 23:48:52,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:48:52,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/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 23:48:52,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 23:48:52,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 23:48:52,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 23:48:52,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:48:52,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:48:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 23:48:52,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 23:48:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 23:48:53,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 23:48:53,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-02 23:48:53,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 23:48:53,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 23:48:53,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 23:48:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 23:48:53,571 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2018-12-02 23:48:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:48:53,672 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-02 23:48:53,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 23:48:53,673 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-12-02 23:48:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:48:53,673 INFO L225 Difference]: With dead ends: 49 [2018-12-02 23:48:53,673 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 23:48:53,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 23:48:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 23:48:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 23:48:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 23:48:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-02 23:48:53,677 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-12-02 23:48:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:48:53,677 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-02 23:48:53,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 23:48:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-02 23:48:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 23:48:53,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:48:53,678 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:48:53,678 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:48:53,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:48:53,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-12-02 23:48:53,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:48:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:53,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:48:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:48:53,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:48:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:48:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:48:53,720 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 23:48:53,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:48:53 BoogieIcfgContainer [2018-12-02 23:48:53,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:48:53,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:48:53,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:48:53,740 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:48:53,741 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:48:47" (3/4) ... [2018-12-02 23:48:53,742 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 23:48:53,770 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_58f36447-17db-4b92-bc6d-f725430c02af/bin-2019/utaipan/witness.graphml [2018-12-02 23:48:53,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:48:53,771 INFO L168 Benchmark]: Toolchain (without parser) took 6686.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 957.8 MB in the beginning and 882.7 MB in the end (delta: 75.1 MB). Peak memory consumption was 396.5 MB. Max. memory is 11.5 GB. [2018-12-02 23:48:53,772 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:48:53,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 121.85 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 23:48:53,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.90 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:48:53,773 INFO L168 Benchmark]: Boogie Preprocessor took 14.43 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:48:53,773 INFO L168 Benchmark]: RCFGBuilder took 144.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 23:48:53,773 INFO L168 Benchmark]: TraceAbstraction took 6357.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 882.7 MB in the end (delta: 234.0 MB). Peak memory consumption was 419.1 MB. Max. memory is 11.5 GB. [2018-12-02 23:48:53,774 INFO L168 Benchmark]: Witness Printer took 30.60 ms. Allocated memory is still 1.4 GB. Free memory is still 882.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:48:53,775 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 121.85 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 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 14.90 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.43 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 144.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6357.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 882.7 MB in the end (delta: 234.0 MB). Peak memory consumption was 419.1 MB. Max. memory is 11.5 GB. * Witness Printer took 30.60 ms. Allocated memory is still 1.4 GB. Free memory is still 882.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=10, input=10] [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 VAL [input=10, result=10] [L13] __VERIFIER_error() VAL [input=10, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 6.3s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 2 SDslu, 2866 SDs, 0 SdLazy, 1208 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 650 SyntacticMatches, 9 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 860 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1146 ConstructedInterpolants, 0 QuantifiedInterpolants, 210054 SizeOfPredicates, 9 NumberOfNonLiveVariables, 810 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 1350/2700 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...