./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:54:20,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:54:20,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:54:20,515 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:54:20,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:54:20,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:54:20,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:54:20,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:54:20,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:54:20,527 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:54:20,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:54:20,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:54:20,531 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:54:20,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:54:20,542 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:54:20,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:54:20,543 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:54:20,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:54:20,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:54:20,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:54:20,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:54:20,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:54:20,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:54:20,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:54:20,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:54:20,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:54:20,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:54:20,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:54:20,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:54:20,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:54:20,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:54:20,559 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:54:20,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:54:20,560 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:54:20,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:54:20,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:54:20,562 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:54:20,582 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:54:20,583 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:54:20,583 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:54:20,584 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:54:20,584 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:54:20,584 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:54:20,584 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:54:20,584 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:54:20,584 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:54:20,585 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:54:20,585 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:54:20,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:54:20,586 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:54:20,586 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:54:20,586 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:54:20,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:54:20,587 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:54:20,587 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:54:20,587 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:54:20,588 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:54:20,588 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:54:20,588 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:54:20,588 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:54:20,588 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:54:20,588 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:54:20,589 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:54:20,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:54:20,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:54:20,589 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:54:20,589 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:54:20,589 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:54:20,589 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:54:20,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:54:20,590 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:54:20,591 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_dd90680c-54fe-4451-b663-6a62d2902d69/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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2018-10-26 19:54:20,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:54:20,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:54:20,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:54:20,648 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:54:20,648 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:54:20,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-26 19:54:20,706 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/data/ba132d14a/1eee5b30e8d14ccf876f3948f8366002/FLAG0c734a75a [2018-10-26 19:54:21,150 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:54:21,151 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-26 19:54:21,170 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/data/ba132d14a/1eee5b30e8d14ccf876f3948f8366002/FLAG0c734a75a [2018-10-26 19:54:21,184 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/data/ba132d14a/1eee5b30e8d14ccf876f3948f8366002 [2018-10-26 19:54:21,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:54:21,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:54:21,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:54:21,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:54:21,195 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:54:21,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dab552f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21, skipping insertion in model container [2018-10-26 19:54:21,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:54:21,259 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:54:21,524 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:54:21,528 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:54:21,623 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:54:21,638 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:54:21,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21 WrapperNode [2018-10-26 19:54:21,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:54:21,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:54:21,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:54:21,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:54:21,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:54:21,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:54:21,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:54:21,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:54:21,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... [2018-10-26 19:54:21,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:54:21,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:54:21,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:54:21,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:54:21,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/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-10-26 19:54:21,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:54:21,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:54:21,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:54:21,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:54:21,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:54:21,912 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:54:23,869 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:54:23,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:54:23 BoogieIcfgContainer [2018-10-26 19:54:23,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:54:23,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:54:23,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:54:23,875 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:54:23,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:54:21" (1/3) ... [2018-10-26 19:54:23,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b4dd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:54:23, skipping insertion in model container [2018-10-26 19:54:23,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:54:21" (2/3) ... [2018-10-26 19:54:23,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b4dd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:54:23, skipping insertion in model container [2018-10-26 19:54:23,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:54:23" (3/3) ... [2018-10-26 19:54:23,879 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-26 19:54:23,886 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:54:23,893 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:54:23,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:54:23,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:54:23,942 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:54:23,942 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:54:23,942 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:54:23,942 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:54:23,943 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:54:23,943 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:54:23,943 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:54:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-10-26 19:54:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 19:54:23,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:23,971 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:23,974 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:23,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:23,980 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-10-26 19:54:23,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:24,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:24,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:24,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:24,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:24,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:54:24,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:54:24,177 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:24,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 19:54:24,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 19:54:24,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:54:24,205 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-10-26 19:54:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:24,243 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-10-26 19:54:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:54:24,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-26 19:54:24,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:24,263 INFO L225 Difference]: With dead ends: 222 [2018-10-26 19:54:24,263 INFO L226 Difference]: Without dead ends: 104 [2018-10-26 19:54:24,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:54:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-26 19:54:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-26 19:54:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-26 19:54:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-10-26 19:54:24,315 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-10-26 19:54:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:24,315 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-10-26 19:54:24,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 19:54:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-10-26 19:54:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 19:54:24,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:24,317 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:24,317 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:24,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-10-26 19:54:24,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:24,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:24,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:54:24,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:54:24,390 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:24,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:54:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:54:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:24,392 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-10-26 19:54:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:24,673 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-10-26 19:54:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:54:24,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-26 19:54:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:24,676 INFO L225 Difference]: With dead ends: 205 [2018-10-26 19:54:24,676 INFO L226 Difference]: Without dead ends: 107 [2018-10-26 19:54:24,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-26 19:54:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-26 19:54:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-26 19:54:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-10-26 19:54:24,687 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-10-26 19:54:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:24,688 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-10-26 19:54:24,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:54:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-10-26 19:54:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 19:54:24,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:24,689 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:24,689 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:24,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-10-26 19:54:24,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:24,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:24,691 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:24,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:54:24,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:54:24,872 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:24,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:54:24,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:54:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:24,873 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-10-26 19:54:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:25,437 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-10-26 19:54:25,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:54:25,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-26 19:54:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:25,439 INFO L225 Difference]: With dead ends: 209 [2018-10-26 19:54:25,440 INFO L226 Difference]: Without dead ends: 190 [2018-10-26 19:54:25,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-26 19:54:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-10-26 19:54:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-26 19:54:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-10-26 19:54:25,455 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-10-26 19:54:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:25,455 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-10-26 19:54:25,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:54:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-10-26 19:54:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 19:54:25,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:25,456 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:25,457 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:25,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:25,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-10-26 19:54:25,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:25,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:25,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:25,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:54:25,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:54:25,588 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:25,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:54:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:54:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:25,588 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-10-26 19:54:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:25,687 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-10-26 19:54:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:54:25,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 19:54:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:25,691 INFO L225 Difference]: With dead ends: 297 [2018-10-26 19:54:25,691 INFO L226 Difference]: Without dead ends: 128 [2018-10-26 19:54:25,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-26 19:54:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-26 19:54:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-26 19:54:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-10-26 19:54:25,702 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-10-26 19:54:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:25,702 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-10-26 19:54:25,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:54:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-10-26 19:54:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:54:25,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:25,704 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:25,704 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:25,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-10-26 19:54:25,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:25,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:25,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:25,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:25,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 19:54:25,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:54:25,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:54:25,833 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:25,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:54:25,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:54:25,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:25,834 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-10-26 19:54:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:25,916 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-10-26 19:54:25,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:54:25,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 19:54:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:25,917 INFO L225 Difference]: With dead ends: 230 [2018-10-26 19:54:25,917 INFO L226 Difference]: Without dead ends: 111 [2018-10-26 19:54:25,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:25,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-26 19:54:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-26 19:54:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-26 19:54:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-10-26 19:54:25,927 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-10-26 19:54:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:25,927 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-10-26 19:54:25,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:54:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-10-26 19:54:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:54:25,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:25,929 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:25,929 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:25,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:25,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-10-26 19:54:25,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:25,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:25,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:25,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:25,931 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:26,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:26,151 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:54:26,152 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-26 19:54:26,154 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [233], [236], [239], [520], [523], [524], [525] [2018-10-26 19:54:26,209 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:54:26,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:54:27,321 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:54:29,220 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 19:54:29,222 INFO L272 AbstractInterpreter]: Visited 23 different actions 47 times. Merged at 15 different actions 19 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-10-26 19:54:29,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:29,252 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 19:54:30,069 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 91.92% of their original sizes. [2018-10-26 19:54:30,069 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 19:54:31,087 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-10-26 19:54:31,088 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 19:54:31,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:54:31,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-26 19:54:31,089 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:31,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 19:54:31,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 19:54:31,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-26 19:54:31,090 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 13 states. [2018-10-26 19:54:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:41,031 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2018-10-26 19:54:41,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 19:54:41,031 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-10-26 19:54:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:41,032 INFO L225 Difference]: With dead ends: 225 [2018-10-26 19:54:41,032 INFO L226 Difference]: Without dead ends: 141 [2018-10-26 19:54:41,033 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-10-26 19:54:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-26 19:54:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-10-26 19:54:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-26 19:54:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2018-10-26 19:54:41,047 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 27 [2018-10-26 19:54:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:41,047 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2018-10-26 19:54:41,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 19:54:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2018-10-26 19:54:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:54:41,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:41,048 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:41,049 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:41,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-10-26 19:54:41,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:41,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:41,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:41,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:41,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:41,915 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-10-26 19:54:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:54:41,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:41,919 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:54:41,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-26 19:54:41,919 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [261], [276], [291], [294], [297], [300], [520], [523], [524], [525] [2018-10-26 19:54:41,922 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:54:41,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:54:42,485 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:54:45,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:54:45,268 INFO L272 AbstractInterpreter]: Visited 28 different actions 57 times. Merged at 21 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 43 variables. [2018-10-26 19:54:45,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:45,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:54:45,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:45,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/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-10-26 19:54:45,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:45,323 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:54:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:45,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:54:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 19:54:45,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:54:46,071 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2018-10-26 19:54:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 19:54:46,205 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:54:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-10-26 19:54:46,205 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:46,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:54:46,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:54:46,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:54:46,206 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand 3 states. [2018-10-26 19:54:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:46,259 INFO L93 Difference]: Finished difference Result 138 states and 204 transitions. [2018-10-26 19:54:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:54:46,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 19:54:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:46,262 INFO L225 Difference]: With dead ends: 138 [2018-10-26 19:54:46,262 INFO L226 Difference]: Without dead ends: 132 [2018-10-26 19:54:46,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:54:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-26 19:54:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-26 19:54:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-26 19:54:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2018-10-26 19:54:46,290 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 31 [2018-10-26 19:54:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:46,294 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2018-10-26 19:54:46,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:54:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2018-10-26 19:54:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 19:54:46,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:46,296 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:46,296 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:46,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:46,296 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-10-26 19:54:46,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:46,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:46,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:46,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:54:46,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:54:46,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:54:46,453 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:46,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:54:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:54:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:46,454 INFO L87 Difference]: Start difference. First operand 131 states and 193 transitions. Second operand 3 states. [2018-10-26 19:54:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:46,744 INFO L93 Difference]: Finished difference Result 218 states and 326 transitions. [2018-10-26 19:54:46,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:54:46,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-26 19:54:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:46,747 INFO L225 Difference]: With dead ends: 218 [2018-10-26 19:54:46,747 INFO L226 Difference]: Without dead ends: 133 [2018-10-26 19:54:46,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:54:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-26 19:54:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-26 19:54:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-26 19:54:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2018-10-26 19:54:46,760 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 192 transitions. Word has length 36 [2018-10-26 19:54:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:46,761 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 192 transitions. [2018-10-26 19:54:46,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:54:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 192 transitions. [2018-10-26 19:54:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 19:54:46,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:46,764 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:46,764 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:46,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:46,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-10-26 19:54:46,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:46,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:46,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:46,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:54:47,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:47,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:54:47,145 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-26 19:54:47,146 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [520], [523], [524], [525] [2018-10-26 19:54:47,148 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:54:47,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:54:47,752 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:54:57,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:54:57,308 INFO L272 AbstractInterpreter]: Visited 30 different actions 136 times. Merged at 23 different actions 88 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 41 variables. [2018-10-26 19:54:57,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:57,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:54:57,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:57,355 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 19:54:57,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:57,368 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:54:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:57,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:54:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:54:57,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:54:58,055 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 13 [2018-10-26 19:54:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:54:58,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:54:58,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-10-26 19:54:58,313 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:54:58,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:54:58,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:54:58,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:54:58,314 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. Second operand 5 states. [2018-10-26 19:54:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:58,907 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2018-10-26 19:54:58,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:54:58,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-26 19:54:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:58,909 INFO L225 Difference]: With dead ends: 194 [2018-10-26 19:54:58,909 INFO L226 Difference]: Without dead ends: 188 [2018-10-26 19:54:58,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:54:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-26 19:54:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2018-10-26 19:54:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-26 19:54:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 269 transitions. [2018-10-26 19:54:58,920 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 269 transitions. Word has length 37 [2018-10-26 19:54:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:58,921 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 269 transitions. [2018-10-26 19:54:58,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:54:58,921 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 269 transitions. [2018-10-26 19:54:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 19:54:58,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:58,924 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:58,924 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:58,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1280054677, now seen corresponding path program 1 times [2018-10-26 19:54:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:58,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:58,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 19:54:59,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:59,116 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:54:59,117 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-26 19:54:59,117 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [344], [347], [350], [520], [523], [524], [525] [2018-10-26 19:54:59,120 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:54:59,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:54:59,519 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:55:06,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:55:06,987 INFO L272 AbstractInterpreter]: Visited 31 different actions 139 times. Merged at 24 different actions 89 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 42 variables. [2018-10-26 19:55:07,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:07,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:55:07,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:55:07,035 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 19:55:07,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:07,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:55:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:07,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:07,547 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-10-26 19:55:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 19:55:07,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:55:08,330 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-26 19:55:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 19:55:08,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:55:08,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2018-10-26 19:55:08,425 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:55:08,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:55:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:55:08,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:55:08,426 INFO L87 Difference]: Start difference. First operand 179 states and 269 transitions. Second operand 5 states. [2018-10-26 19:55:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:10,070 INFO L93 Difference]: Finished difference Result 268 states and 402 transitions. [2018-10-26 19:55:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:55:10,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-10-26 19:55:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:10,073 INFO L225 Difference]: With dead ends: 268 [2018-10-26 19:55:10,073 INFO L226 Difference]: Without dead ends: 254 [2018-10-26 19:55:10,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:55:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-26 19:55:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-10-26 19:55:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 19:55:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2018-10-26 19:55:10,088 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 38 [2018-10-26 19:55:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:10,088 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2018-10-26 19:55:10,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:55:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2018-10-26 19:55:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 19:55:10,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:10,089 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:10,090 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:10,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-10-26 19:55:10,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:55:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:10,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:10,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:10,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:55:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:10,346 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 19:55:10,522 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 19:55:10,730 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-26 19:55:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:10,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:55:10,735 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:55:10,735 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-26 19:55:10,735 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [520], [523], [524], [525] [2018-10-26 19:55:10,737 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:55:10,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:55:11,230 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:55:20,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:55:20,895 INFO L272 AbstractInterpreter]: Visited 33 different actions 148 times. Merged at 26 different actions 97 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 44 variables. [2018-10-26 19:55:20,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:20,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:55:20,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:55:20,896 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/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-10-26 19:55:20,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:20,905 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:55:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:20,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:21,397 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-10-26 19:55:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:21,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:55:21,951 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 12 [2018-10-26 19:55:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:22,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:55:22,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-10-26 19:55:22,112 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:55:22,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:55:22,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:55:22,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:55:22,113 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 6 states. [2018-10-26 19:55:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:22,691 INFO L93 Difference]: Finished difference Result 260 states and 381 transitions. [2018-10-26 19:55:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:55:22,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-26 19:55:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:22,694 INFO L225 Difference]: With dead ends: 260 [2018-10-26 19:55:22,694 INFO L226 Difference]: Without dead ends: 258 [2018-10-26 19:55:22,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:55:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-26 19:55:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2018-10-26 19:55:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-26 19:55:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2018-10-26 19:55:22,708 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 40 [2018-10-26 19:55:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:22,708 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2018-10-26 19:55:22,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:55:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2018-10-26 19:55:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 19:55:22,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:22,709 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:22,709 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:22,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:22,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-10-26 19:55:22,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:55:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:22,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:22,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:55:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:55:22,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:22,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:55:22,808 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:55:22,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:55:22,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:55:22,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:22,809 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand 3 states. [2018-10-26 19:55:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:23,077 INFO L93 Difference]: Finished difference Result 440 states and 652 transitions. [2018-10-26 19:55:23,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:23,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-26 19:55:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:23,079 INFO L225 Difference]: With dead ends: 440 [2018-10-26 19:55:23,080 INFO L226 Difference]: Without dead ends: 235 [2018-10-26 19:55:23,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-26 19:55:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-10-26 19:55:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-26 19:55:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 336 transitions. [2018-10-26 19:55:23,093 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 336 transitions. Word has length 41 [2018-10-26 19:55:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:23,095 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 336 transitions. [2018-10-26 19:55:23,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:55:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 336 transitions. [2018-10-26 19:55:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 19:55:23,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:23,097 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:23,097 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:23,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:23,098 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-10-26 19:55:23,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:55:23,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:23,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:23,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:55:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 19:55:23,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:55:23,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:55:23,196 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:55:23,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:55:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:55:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:23,197 INFO L87 Difference]: Start difference. First operand 233 states and 336 transitions. Second operand 3 states. [2018-10-26 19:55:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:23,481 INFO L93 Difference]: Finished difference Result 318 states and 458 transitions. [2018-10-26 19:55:23,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:55:23,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-26 19:55:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:23,483 INFO L225 Difference]: With dead ends: 318 [2018-10-26 19:55:23,483 INFO L226 Difference]: Without dead ends: 150 [2018-10-26 19:55:23,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:55:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-26 19:55:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-26 19:55:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-26 19:55:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2018-10-26 19:55:23,496 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 50 [2018-10-26 19:55:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:23,496 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2018-10-26 19:55:23,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:55:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2018-10-26 19:55:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 19:55:23,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:23,500 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:23,500 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:23,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-10-26 19:55:23,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:55:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:23,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:23,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:55:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:55:23,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:55:23,959 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:55:23,959 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-26 19:55:23,959 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [520], [523], [524], [525] [2018-10-26 19:55:23,961 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:55:23,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:55:24,440 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:55:33,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:55:33,743 INFO L272 AbstractInterpreter]: Visited 39 different actions 211 times. Merged at 32 different actions 142 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 46 variables. [2018-10-26 19:55:33,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:33,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:55:33,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:55:33,751 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/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-10-26 19:55:33,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:33,772 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:55:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:33,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:55:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:33,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:55:34,160 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-10-26 19:55:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:34,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:55:34,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-10-26 19:55:34,251 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:55:34,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:55:34,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:55:34,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-26 19:55:34,252 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand 9 states. [2018-10-26 19:55:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:55:34,503 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2018-10-26 19:55:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 19:55:34,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-10-26 19:55:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:55:34,505 INFO L225 Difference]: With dead ends: 191 [2018-10-26 19:55:34,506 INFO L226 Difference]: Without dead ends: 187 [2018-10-26 19:55:34,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-26 19:55:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-26 19:55:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2018-10-26 19:55:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-26 19:55:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 258 transitions. [2018-10-26 19:55:34,521 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 258 transitions. Word has length 51 [2018-10-26 19:55:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:55:34,521 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 258 transitions. [2018-10-26 19:55:34,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:55:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-10-26 19:55:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-26 19:55:34,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:55:34,522 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:55:34,522 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:55:34,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:55:34,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-10-26 19:55:34,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:55:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:34,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:55:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:55:34,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:55:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:55:34,771 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 19:55:34,942 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 19:55:35,455 WARN L179 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-10-26 19:55:35,667 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-26 19:55:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:55:35,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:55:35,694 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:55:35,694 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-10-26 19:55:35,695 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [48], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-26 19:55:35,696 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:55:35,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:55:36,004 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:57:50,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:57:50,317 INFO L272 AbstractInterpreter]: Visited 44 different actions 2796 times. Merged at 37 different actions 2398 times. Widened at 5 different actions 158 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-10-26 19:57:50,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:50,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:57:50,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:57:50,327 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/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-10-26 19:57:50,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:57:50,335 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:57:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:50,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:50,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:57:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 19:57:51,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:57:51,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-10-26 19:57:51,284 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:57:51,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:57:51,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:57:51,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-26 19:57:51,285 INFO L87 Difference]: Start difference. First operand 184 states and 258 transitions. Second operand 9 states. [2018-10-26 19:57:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:57:51,956 INFO L93 Difference]: Finished difference Result 188 states and 262 transitions. [2018-10-26 19:57:51,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 19:57:51,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-26 19:57:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:57:51,958 INFO L225 Difference]: With dead ends: 188 [2018-10-26 19:57:51,958 INFO L226 Difference]: Without dead ends: 186 [2018-10-26 19:57:51,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-10-26 19:57:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-26 19:57:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-26 19:57:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-26 19:57:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2018-10-26 19:57:51,965 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 61 [2018-10-26 19:57:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:57:51,965 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2018-10-26 19:57:51,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:57:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2018-10-26 19:57:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-26 19:57:51,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:57:51,967 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:57:51,967 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:57:51,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:51,967 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-10-26 19:57:51,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:57:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:57:51,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:57:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:57:51,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:57:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:52,240 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 19:57:52,430 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 19:57:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:52,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:57:52,529 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:57:52,530 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-10-26 19:57:52,530 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [254], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-26 19:57:52,532 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:57:52,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:57:52,802 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:59:52,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:59:52,814 INFO L272 AbstractInterpreter]: Visited 44 different actions 2808 times. Merged at 37 different actions 2408 times. Widened at 5 different actions 163 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-10-26 19:59:52,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:52,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:59:52,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:59:52,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/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-10-26 19:59:52,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:52,831 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:59:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:52,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:59:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:52,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:59:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 19:59:53,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:59:53,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 12 [2018-10-26 19:59:53,069 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:59:53,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 19:59:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 19:59:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:59:53,070 INFO L87 Difference]: Start difference. First operand 185 states and 259 transitions. Second operand 8 states. [2018-10-26 19:59:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:53,600 INFO L93 Difference]: Finished difference Result 209 states and 292 transitions. [2018-10-26 19:59:53,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 19:59:53,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-10-26 19:59:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:53,602 INFO L225 Difference]: With dead ends: 209 [2018-10-26 19:59:53,602 INFO L226 Difference]: Without dead ends: 206 [2018-10-26 19:59:53,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:59:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-26 19:59:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-10-26 19:59:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-26 19:59:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 288 transitions. [2018-10-26 19:59:53,617 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 288 transitions. Word has length 70 [2018-10-26 19:59:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:53,617 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 288 transitions. [2018-10-26 19:59:53,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 19:59:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 288 transitions. [2018-10-26 19:59:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 19:59:53,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:53,621 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:53,622 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:53,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash 564297596, now seen corresponding path program 1 times [2018-10-26 19:59:53,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:53,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:53,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 19:59:54,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:59:54,424 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:59:54,424 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-10-26 19:59:54,424 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-26 19:59:54,427 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:59:54,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:59:54,690 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:01:56,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:01:56,006 INFO L272 AbstractInterpreter]: Visited 46 different actions 2950 times. Merged at 39 different actions 2550 times. Widened at 5 different actions 163 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-10-26 20:01:56,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:56,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:01:56,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:01:56,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/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-10-26 20:01:56,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:56,022 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:01:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:56,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:01:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 20:01:56,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:01:56,544 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 12 [2018-10-26 20:01:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-26 20:01:56,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:01:56,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2018-10-26 20:01:56,675 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:01:56,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:01:56,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:01:56,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:01:56,676 INFO L87 Difference]: Start difference. First operand 206 states and 288 transitions. Second operand 7 states. [2018-10-26 20:01:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:56,947 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions. [2018-10-26 20:01:56,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:01:56,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-10-26 20:01:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:56,948 INFO L225 Difference]: With dead ends: 230 [2018-10-26 20:01:56,948 INFO L226 Difference]: Without dead ends: 227 [2018-10-26 20:01:56,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:01:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-26 20:01:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-10-26 20:01:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-26 20:01:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 313 transitions. [2018-10-26 20:01:56,957 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 313 transitions. Word has length 79 [2018-10-26 20:01:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:56,957 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 313 transitions. [2018-10-26 20:01:56,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:01:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 313 transitions. [2018-10-26 20:01:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 20:01:56,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:56,958 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:56,958 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:56,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:56,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1030800333, now seen corresponding path program 1 times [2018-10-26 20:01:56,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:01:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:56,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:56,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:01:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:57,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:01:57,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:01:57,247 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-10-26 20:01:57,247 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-26 20:01:57,248 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:01:57,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:01:57,506 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:04:08,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:04:08,235 INFO L272 AbstractInterpreter]: Visited 44 different actions 2806 times. Merged at 37 different actions 2408 times. Widened at 5 different actions 163 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-10-26 20:04:08,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:08,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:04:08,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:04:08,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/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-10-26 20:04:08,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:08,251 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:04:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:08,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:08,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:04:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 20:04:08,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:04:08,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2018-10-26 20:04:08,997 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:04:08,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:04:08,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:04:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-26 20:04:08,997 INFO L87 Difference]: Start difference. First operand 224 states and 313 transitions. Second operand 10 states. [2018-10-26 20:04:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:09,095 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2018-10-26 20:04:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:04:09,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-10-26 20:04:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:09,097 INFO L225 Difference]: With dead ends: 227 [2018-10-26 20:04:09,097 INFO L226 Difference]: Without dead ends: 225 [2018-10-26 20:04:09,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-26 20:04:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-26 20:04:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-10-26 20:04:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-26 20:04:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 314 transitions. [2018-10-26 20:04:09,105 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 314 transitions. Word has length 82 [2018-10-26 20:04:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:09,106 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 314 transitions. [2018-10-26 20:04:09,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 20:04:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 314 transitions. [2018-10-26 20:04:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 20:04:09,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:09,107 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:04:09,107 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:09,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:09,107 INFO L82 PathProgramCache]: Analyzing trace with hash 644642791, now seen corresponding path program 1 times [2018-10-26 20:04:09,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:04:09,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:09,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:09,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:09,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:04:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 20:04:09,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:04:09,340 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:04:09,340 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-10-26 20:04:09,340 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-26 20:04:09,342 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:04:09,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:04:09,611 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:06:05,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:06:05,025 INFO L272 AbstractInterpreter]: Visited 46 different actions 2937 times. Merged at 39 different actions 2536 times. Widened at 5 different actions 159 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-10-26 20:06:05,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:05,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:06:05,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:05,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:06:05,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:05,039 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:06:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:05,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:05,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:06:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-26 20:06:05,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:06:05,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 19 [2018-10-26 20:06:05,438 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:06:05,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 20:06:05,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 20:06:05,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:06:05,439 INFO L87 Difference]: Start difference. First operand 225 states and 314 transitions. Second operand 15 states. [2018-10-26 20:06:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:05,532 INFO L93 Difference]: Finished difference Result 268 states and 374 transitions. [2018-10-26 20:06:05,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 20:06:05,533 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-10-26 20:06:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:05,534 INFO L225 Difference]: With dead ends: 268 [2018-10-26 20:06:05,534 INFO L226 Difference]: Without dead ends: 264 [2018-10-26 20:06:05,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:06:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-26 20:06:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-10-26 20:06:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-26 20:06:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 365 transitions. [2018-10-26 20:06:05,546 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 365 transitions. Word has length 93 [2018-10-26 20:06:05,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:05,547 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 365 transitions. [2018-10-26 20:06:05,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 20:06:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 365 transitions. [2018-10-26 20:06:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 20:06:05,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:05,549 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:05,549 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:05,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1306502892, now seen corresponding path program 2 times [2018-10-26 20:06:05,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:05,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:05,550 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:05,874 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:06:06,047 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:06:06,222 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-26 20:06:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:06,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:06,360 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:06:06,361 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:06:06,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:06:06,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:06,361 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:06:06,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 20:06:06,369 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 20:06:06,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-26 20:06:06,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:06:06,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 20:06:06,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:06:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 20:06:07,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:06:07,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2018-10-26 20:06:07,756 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:06:07,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 20:06:07,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 20:06:07,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:06:07,757 INFO L87 Difference]: Start difference. First operand 261 states and 365 transitions. Second operand 18 states. [2018-10-26 20:06:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:08,966 INFO L93 Difference]: Finished difference Result 275 states and 380 transitions. [2018-10-26 20:06:08,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-26 20:06:08,967 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 103 [2018-10-26 20:06:08,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:08,968 INFO L225 Difference]: With dead ends: 275 [2018-10-26 20:06:08,968 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 20:06:08,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2018-10-26 20:06:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 20:06:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 20:06:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 20:06:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 20:06:08,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-10-26 20:06:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:08,970 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 20:06:08,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 20:06:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 20:06:08,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 20:06:08,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 20:06:09,135 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 213 [2018-10-26 20:06:10,068 WARN L179 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 45 [2018-10-26 20:06:10,269 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 37 [2018-10-26 20:06:10,271 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 20:06:10,271 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:06:10,272 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 20:06:10,272 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-10-26 20:06:10,272 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-10-26 20:06:10,273 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-10-26 20:06:10,274 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-10-26 20:06:10,274 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-10-26 20:06:10,274 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-10-26 20:06:10,274 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-10-26 20:06:10,274 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-10-26 20:06:10,274 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-10-26 20:06:10,275 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-10-26 20:06:10,275 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-10-26 20:06:10,275 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-10-26 20:06:10,275 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-10-26 20:06:10,276 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L421 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-10-26 20:06:10,277 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-10-26 20:06:10,278 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= 0 (+ main_~P8~0 2147483648))) (.cse2 (<= main_~P8~0 2147483647)) (.cse3 (<= main_~this_buffer_empty~0 0)) (.cse4 (<= 0 main_~this_buffer_empty~0))) (or (and (exists ((main_~P1~0 Int)) (let ((.cse0 (mod main_~P1~0 2))) (and (= .cse0 0) (= .cse0 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) .cse1 .cse2 .cse3 .cse4) (and (exists ((main_~P1~0 Int)) (let ((.cse5 (mod main_~P1~0 2))) (and (= .cse5 0) (= .cse5 (mod (+ main_~this_expect~0 1) 2))))) .cse1 .cse2 .cse3 (= main_~q~0 3) .cse4) (and (<= main_~this_expect~0 main_~q~0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse3 .cse4))) [2018-10-26 20:06:10,278 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 24 561) no Hoare annotation was computed. [2018-10-26 20:06:10,278 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-10-26 20:06:10,278 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-10-26 20:06:10,278 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-10-26 20:06:10,278 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-10-26 20:06:10,278 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-10-26 20:06:10,278 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-10-26 20:06:10,278 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-10-26 20:06:10,278 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L421 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= main_~this_buffer_empty~0 1)) (.cse3 (<= 1 main_~this_buffer_empty~0)) (.cse7 (exists ((main_~P1~0 Int)) (let ((.cse9 (mod main_~P1~0 2))) (and (= .cse9 0) (= .cse9 (mod main_~this_expect~0 2)))))) (.cse0 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod (+ main_~this_expect~0 1) 2)))))) (.cse2 (<= 0 (+ main_~P8~0 2147483648))) (.cse4 (<= main_~P8~0 2147483647)) (.cse5 (<= main_~this_buffer_empty~0 0)) (.cse6 (<= 0 main_~this_buffer_empty~0))) (or (and .cse0 .cse1 .cse2 (= main_~q~0 4) .cse3 .cse4) (and (and (<= main_~this_expect~0 main_~q~0) (= main_~q~0 0)) (<= 0 main_~this_expect~0) .cse5 .cse6) (and .cse7 (= main_~q~0 1) .cse1 .cse2 .cse3 .cse4) (and .cse7 (<= 5 main_~q~0) .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse4 .cse5 (= main_~q~0 3) .cse6))) [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-10-26 20:06:10,279 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-10-26 20:06:10,280 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-10-26 20:06:10,280 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-10-26 20:06:10,281 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-10-26 20:06:10,282 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-10-26 20:06:10,282 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-10-26 20:06:10,282 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-10-26 20:06:10,282 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-10-26 20:06:10,282 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-10-26 20:06:10,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,306 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,306 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,326 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:06:10 BoogieIcfgContainer [2018-10-26 20:06:10,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:06:10,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:06:10,331 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:06:10,331 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:06:10,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:54:23" (3/4) ... [2018-10-26 20:06:10,335 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 20:06:10,341 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 20:06:10,341 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 20:06:10,351 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-10-26 20:06:10,351 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 20:06:10,376 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && q == 3) && 0 <= this_buffer_empty)) || ((((this_expect <= q && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) [2018-10-26 20:06:10,386 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dd90680c-54fe-4451-b663-6a62d2902d69/bin-2019/utaipan/witness.graphml [2018-10-26 20:06:10,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:06:10,387 INFO L168 Benchmark]: Toolchain (without parser) took 709199.13 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 953.1 MB in the beginning and 1.6 GB in the end (delta: -685.3 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-10-26 20:06:10,388 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:06:10,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.36 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 931.6 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:10,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.51 ms. Allocated memory is still 1.0 GB. Free memory was 931.6 MB in the beginning and 928.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:10,389 INFO L168 Benchmark]: Boogie Preprocessor took 162.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:10,389 INFO L168 Benchmark]: RCFGBuilder took 2035.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:10,390 INFO L168 Benchmark]: TraceAbstraction took 706459.50 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -584.0 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-10-26 20:06:10,394 INFO L168 Benchmark]: Witness Printer took 55.43 ms. Allocated memory is still 5.1 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:06:10,398 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.36 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 931.6 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.51 ms. Allocated memory is still 1.0 GB. Free memory was 931.6 MB in the beginning and 928.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 162.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2035.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 706459.50 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -584.0 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 55.43 ms. Allocated memory is still 5.1 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-10-26 20:06:10,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && q == 4) && 1 <= this_buffer_empty) && P8 <= 2147483647) || ((((this_expect <= q && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && q == 1) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && q == 3) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2018-10-26 20:06:10,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-26 20:06:10,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && q == 3) && 0 <= this_buffer_empty)) || ((((this_expect <= q && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 706.3s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 17.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 3319 SDtfs, 2282 SDslu, 9787 SDs, 0 SdLazy, 1572 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1529 GetRequests, 1358 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 667.7s AbstIntTime, 11 AbstIntIterations, 1 AbstIntStrong, 0.943293885601578 AbsIntWeakeningRatio, 1.7307692307692308 AbsIntAvgWeakeningVarsNumRemoved, 662.5769230769231 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 61 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 40 NumberOfFragments, 238 HoareAnnotationTreeSize, 7 FomulaSimplifications, 819 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2772 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 1615 NumberOfCodeBlocks, 1573 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2258 ConstructedInterpolants, 297 QuantifiedInterpolants, 1685642 SizeOfPredicates, 55 NumberOfNonLiveVariables, 4413 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 42 InterpolantComputations, 10 PerfectInterpolantSequences, 952/2434 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...