./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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-5842f4b [2018-11-18 14:47:42,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:47:42,109 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:47:42,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:47:42,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:47:42,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:47:42,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:47:42,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:47:42,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:47:42,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:47:42,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:47:42,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:47:42,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:47:42,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:47:42,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:47:42,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:47:42,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:47:42,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:47:42,126 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:47:42,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:47:42,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:47:42,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:47:42,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:47:42,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:47:42,129 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:47:42,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:47:42,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:47:42,131 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:47:42,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:47:42,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:47:42,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:47:42,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:47:42,133 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:47:42,133 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:47:42,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:47:42,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:47:42,135 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:47:42,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:47:42,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:47:42,142 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:47:42,142 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:47:42,142 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:47:42,143 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:47:42,143 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:47:42,143 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:47:42,143 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:47:42,143 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:47:42,143 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:47:42,143 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:47:42,143 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:47:42,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:47:42,144 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:47:42,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:47:42,144 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:47:42,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:47:42,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:47:42,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:47:42,145 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:47:42,145 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:47:42,145 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:47:42,145 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:47:42,145 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:47:42,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:47:42,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:47:42,145 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:47:42,146 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:47:42,146 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:47:42,146 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:47:42,146 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:47:42,146 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:47:42,146 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:47:42,146 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:47:42,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:47:42,147 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:47:42,147 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_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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-11-18 14:47:42,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:47:42,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:47:42,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:47:42,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:47:42,184 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:47:42,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-18 14:47:42,228 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/data/6e2912832/e0c3f6b23f474ea39e38dd6bfa759984/FLAGc4c15ce41 [2018-11-18 14:47:42,645 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:47:42,645 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-18 14:47:42,654 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/data/6e2912832/e0c3f6b23f474ea39e38dd6bfa759984/FLAGc4c15ce41 [2018-11-18 14:47:42,665 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/data/6e2912832/e0c3f6b23f474ea39e38dd6bfa759984 [2018-11-18 14:47:42,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:47:42,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:47:42,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:47:42,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:47:42,672 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:47:42,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:42,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a2125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42, skipping insertion in model container [2018-11-18 14:47:42,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:42,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:47:42,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:47:42,873 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:47:42,876 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:47:42,925 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:47:42,936 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:47:42,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42 WrapperNode [2018-11-18 14:47:42,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:47:42,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:47:42,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:47:42,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:47:42,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:42,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:43,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:47:43,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:47:43,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:47:43,002 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:47:43,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:43,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:43,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:43,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:43,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:43,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:43,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... [2018-11-18 14:47:43,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:47:43,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:47:43,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:47:43,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:47:43,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:47:43,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:47:43,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:47:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:47:43,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:47:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:47:43,089 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:47:43,695 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:47:43,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:47:43 BoogieIcfgContainer [2018-11-18 14:47:43,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:47:43,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:47:43,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:47:43,698 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:47:43,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:47:42" (1/3) ... [2018-11-18 14:47:43,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317a8adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:47:43, skipping insertion in model container [2018-11-18 14:47:43,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:47:42" (2/3) ... [2018-11-18 14:47:43,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317a8adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:47:43, skipping insertion in model container [2018-11-18 14:47:43,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:47:43" (3/3) ... [2018-11-18 14:47:43,701 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-18 14:47:43,707 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:47:43,712 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:47:43,722 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:47:43,743 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:47:43,743 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:47:43,743 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:47:43,743 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:47:43,743 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:47:43,743 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:47:43,744 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:47:43,744 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:47:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-18 14:47:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 14:47:43,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:43,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:47:43,763 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:43,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:43,767 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-11-18 14:47:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:43,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:43,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:43,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:47:43,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:47:43,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:43,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 14:47:43,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 14:47:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 14:47:43,870 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-11-18 14:47:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:43,894 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-11-18 14:47:43,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 14:47:43,895 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-18 14:47:43,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:43,902 INFO L225 Difference]: With dead ends: 222 [2018-11-18 14:47:43,902 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 14:47:43,905 INFO L604 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-11-18 14:47:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 14:47:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-18 14:47:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 14:47:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-11-18 14:47:43,936 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-11-18 14:47:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:43,937 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-11-18 14:47:43,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 14:47:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-11-18 14:47:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 14:47:43,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:43,938 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:47:43,938 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:43,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-11-18 14:47:43,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:43,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:43,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:43,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:47:43,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:47:43,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:43,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:47:43,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:47:43,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:47:43,988 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-11-18 14:47:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:44,041 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-11-18 14:47:44,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:47:44,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-18 14:47:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:44,043 INFO L225 Difference]: With dead ends: 205 [2018-11-18 14:47:44,043 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 14:47:44,043 INFO L604 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-11-18 14:47:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 14:47:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-18 14:47:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 14:47:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-11-18 14:47:44,051 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-11-18 14:47:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:44,051 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-11-18 14:47:44,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:47:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-11-18 14:47:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 14:47:44,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:44,052 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:47:44,052 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:44,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-11-18 14:47:44,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:44,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:44,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:44,543 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 39 [2018-11-18 14:47:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:44,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:47:44,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:47:44,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:44,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:47:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:47:44,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:47:44,549 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2018-11-18 14:47:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:44,749 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-11-18 14:47:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:47:44,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-18 14:47:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:44,751 INFO L225 Difference]: With dead ends: 209 [2018-11-18 14:47:44,751 INFO L226 Difference]: Without dead ends: 190 [2018-11-18 14:47:44,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:47:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-18 14:47:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-11-18 14:47:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 14:47:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-11-18 14:47:44,761 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-11-18 14:47:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:44,761 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-11-18 14:47:44,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:47:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-18 14:47:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 14:47:44,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:44,762 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-11-18 14:47:44,763 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:44,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-11-18 14:47:44,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:44,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:44,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:44,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:44,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:47:44,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:47:44,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:44,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:47:44,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:47:44,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:47:44,792 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-11-18 14:47:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:44,819 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-11-18 14:47:44,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:47:44,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 14:47:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:44,820 INFO L225 Difference]: With dead ends: 297 [2018-11-18 14:47:44,820 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 14:47:44,821 INFO L604 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-11-18 14:47:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 14:47:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-18 14:47:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-18 14:47:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-11-18 14:47:44,829 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-11-18 14:47:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:44,829 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-11-18 14:47:44,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:47:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-11-18 14:47:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 14:47:44,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:44,830 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-11-18 14:47:44,830 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:44,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-11-18 14:47:44,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:44,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:44,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:44,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 14:47:44,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:47:44,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:47:44,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:44,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:47:44,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:47:44,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:47:44,880 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-11-18 14:47:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:44,910 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-11-18 14:47:44,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:47:44,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 14:47:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:44,911 INFO L225 Difference]: With dead ends: 230 [2018-11-18 14:47:44,912 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 14:47:44,912 INFO L604 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-11-18 14:47:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 14:47:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-18 14:47:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 14:47:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-11-18 14:47:44,918 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-11-18 14:47:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:44,918 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-11-18 14:47:44,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:47:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-11-18 14:47:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 14:47:44,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:44,919 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-11-18 14:47:44,919 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:44,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-11-18 14:47:44,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:44,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:44,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:45,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:45,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:45,001 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-18 14:47:45,003 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-11-18 14:47:45,027 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:45,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:45,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:45,341 INFO L272 AbstractInterpreter]: Visited 24 different actions 49 times. Merged at 17 different actions 21 times. Never widened. Performed 683 root evaluator evaluations with a maximum evaluation depth of 10. Performed 683 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-11-18 14:47:45,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:45,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:45,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:45,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:47:45,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:45,372 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:45,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:45,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:45,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:45,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 14:47:45,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:45,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:47:45,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:47:45,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:47:45,517 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-11-18 14:47:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:45,651 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-11-18 14:47:45,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:47:45,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 14:47:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:45,653 INFO L225 Difference]: With dead ends: 192 [2018-11-18 14:47:45,653 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 14:47:45,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:47:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 14:47:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-18 14:47:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 14:47:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-11-18 14:47:45,662 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-11-18 14:47:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:45,663 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-11-18 14:47:45,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:47:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-11-18 14:47:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 14:47:45,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:45,664 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] [2018-11-18 14:47:45,664 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:45,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:45,664 INFO L82 PathProgramCache]: Analyzing trace with hash 945458420, now seen corresponding path program 1 times [2018-11-18 14:47:45,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:45,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:45,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:45,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:45,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:45,920 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 33 [2018-11-18 14:47:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:45,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:45,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:45,923 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-18 14:47:45,924 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [254], [520], [523], [524], [525] [2018-11-18 14:47:45,925 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:45,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:46,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:46,053 INFO L272 AbstractInterpreter]: Visited 25 different actions 51 times. Merged at 18 different actions 22 times. Never widened. Performed 721 root evaluator evaluations with a maximum evaluation depth of 10. Performed 721 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 3 different actions. Largest state had 40 variables. [2018-11-18 14:47:46,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:46,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:46,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:46,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:47:46,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:46,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:46,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:46,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:46,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:46,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2018-11-18 14:47:46,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:46,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:47:46,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:47:46,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:47:46,183 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 5 states. [2018-11-18 14:47:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:46,312 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2018-11-18 14:47:46,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:47:46,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-18 14:47:46,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:46,313 INFO L225 Difference]: With dead ends: 230 [2018-11-18 14:47:46,313 INFO L226 Difference]: Without dead ends: 226 [2018-11-18 14:47:46,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:47:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-18 14:47:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2018-11-18 14:47:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-18 14:47:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2018-11-18 14:47:46,321 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 28 [2018-11-18 14:47:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:46,321 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2018-11-18 14:47:46,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:47:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2018-11-18 14:47:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 14:47:46,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:46,322 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] [2018-11-18 14:47:46,322 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:46,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1709359769, now seen corresponding path program 1 times [2018-11-18 14:47:46,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:46,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:46,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 14:47:46,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:47:46,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:47:46,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:46,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:47:46,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:47:46,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:47:46,344 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand 3 states. [2018-11-18 14:47:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:46,368 INFO L93 Difference]: Finished difference Result 391 states and 608 transitions. [2018-11-18 14:47:46,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:47:46,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 14:47:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:46,369 INFO L225 Difference]: With dead ends: 391 [2018-11-18 14:47:46,369 INFO L226 Difference]: Without dead ends: 202 [2018-11-18 14:47:46,370 INFO L604 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-11-18 14:47:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-18 14:47:46,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-11-18 14:47:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 14:47:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2018-11-18 14:47:46,374 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 29 [2018-11-18 14:47:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:46,374 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2018-11-18 14:47:46,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:47:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2018-11-18 14:47:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 14:47:46,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:46,375 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-11-18 14:47:46,375 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:46,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:46,375 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-11-18 14:47:46,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:46,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:46,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:46,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:46,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:46,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:46,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:46,572 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-18 14:47:46,573 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-11-18 14:47:46,574 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:46,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:46,648 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:46,649 INFO L272 AbstractInterpreter]: Visited 28 different actions 39 times. Merged at 7 different actions 8 times. Never widened. Performed 497 root evaluator evaluations with a maximum evaluation depth of 10. Performed 497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 3 fixpoints after 2 different actions. Largest state had 43 variables. [2018-11-18 14:47:46,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:46,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:46,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:46,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:47:46,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:46,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:46,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:47:46,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:47:46,838 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:47:46,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-18 14:47:46,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:46,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:47:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:47:46,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:47:46,839 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2018-11-18 14:47:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:46,848 INFO L93 Difference]: Finished difference Result 203 states and 303 transitions. [2018-11-18 14:47:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:47:46,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 14:47:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:46,850 INFO L225 Difference]: With dead ends: 203 [2018-11-18 14:47:46,850 INFO L226 Difference]: Without dead ends: 197 [2018-11-18 14:47:46,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:47:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-18 14:47:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-11-18 14:47:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-18 14:47:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 292 transitions. [2018-11-18 14:47:46,856 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 292 transitions. Word has length 31 [2018-11-18 14:47:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:46,857 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 292 transitions. [2018-11-18 14:47:46,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:47:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 292 transitions. [2018-11-18 14:47:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 14:47:46,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:46,858 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-11-18 14:47:46,858 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:46,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:46,858 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-11-18 14:47:46,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:46,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:46,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:46,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:46,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 14:47:46,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:47:46,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:47:46,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:46,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:47:46,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:47:46,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:47:46,886 INFO L87 Difference]: Start difference. First operand 196 states and 292 transitions. Second operand 3 states. [2018-11-18 14:47:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:46,909 INFO L93 Difference]: Finished difference Result 348 states and 524 transitions. [2018-11-18 14:47:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:47:46,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 14:47:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:46,911 INFO L225 Difference]: With dead ends: 348 [2018-11-18 14:47:46,911 INFO L226 Difference]: Without dead ends: 198 [2018-11-18 14:47:46,912 INFO L604 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-11-18 14:47:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-18 14:47:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-18 14:47:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-18 14:47:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2018-11-18 14:47:46,918 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 36 [2018-11-18 14:47:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:46,918 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2018-11-18 14:47:46,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:47:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2018-11-18 14:47:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 14:47:46,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:46,919 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-11-18 14:47:46,919 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:46,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:46,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-11-18 14:47:46,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:46,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:46,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:46,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:47:47,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:47,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:47,000 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-18 14:47:47,000 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-11-18 14:47:47,003 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:47,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:47,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:47,149 INFO L272 AbstractInterpreter]: Visited 30 different actions 79 times. Merged at 23 different actions 41 times. Never widened. Performed 1029 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1029 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 9 fixpoints after 6 different actions. Largest state had 41 variables. [2018-11-18 14:47:47,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:47,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:47,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:47,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:47:47,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:47,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:47,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:47:47,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:47:47,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:47,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-18 14:47:47,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:47,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:47:47,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:47:47,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:47:47,362 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand 5 states. [2018-11-18 14:47:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:47,433 INFO L93 Difference]: Finished difference Result 255 states and 378 transitions. [2018-11-18 14:47:47,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:47:47,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-18 14:47:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:47,435 INFO L225 Difference]: With dead ends: 255 [2018-11-18 14:47:47,435 INFO L226 Difference]: Without dead ends: 250 [2018-11-18 14:47:47,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:47:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-18 14:47:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2018-11-18 14:47:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-18 14:47:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 364 transitions. [2018-11-18 14:47:47,443 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 364 transitions. Word has length 37 [2018-11-18 14:47:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:47,443 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 364 transitions. [2018-11-18 14:47:47,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:47:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 364 transitions. [2018-11-18 14:47:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 14:47:47,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:47,444 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-11-18 14:47:47,444 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:47,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-11-18 14:47:47,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:47,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:47,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:47,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:47,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:47,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:47,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:47,646 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-18 14:47:47,647 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-11-18 14:47:47,648 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:47,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:47,721 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:47,721 INFO L272 AbstractInterpreter]: Visited 33 different actions 44 times. Merged at 7 different actions 8 times. Never widened. Performed 539 root evaluator evaluations with a maximum evaluation depth of 10. Performed 539 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 3 different actions. Largest state had 44 variables. [2018-11-18 14:47:47,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:47,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:47,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:47,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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-11-18 14:47:47,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:47,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:47,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:47,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:48,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:48,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-18 14:47:48,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:48,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:47:48,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:47:48,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:47:48,109 INFO L87 Difference]: Start difference. First operand 244 states and 364 transitions. Second operand 8 states. [2018-11-18 14:47:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:48,239 INFO L93 Difference]: Finished difference Result 254 states and 373 transitions. [2018-11-18 14:47:48,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:47:48,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-18 14:47:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:48,241 INFO L225 Difference]: With dead ends: 254 [2018-11-18 14:47:48,241 INFO L226 Difference]: Without dead ends: 252 [2018-11-18 14:47:48,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:47:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-18 14:47:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-11-18 14:47:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-18 14:47:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2018-11-18 14:47:48,251 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 40 [2018-11-18 14:47:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:48,251 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2018-11-18 14:47:48,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:47:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2018-11-18 14:47:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 14:47:48,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:48,252 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-11-18 14:47:48,252 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:48,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:48,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-11-18 14:47:48,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:48,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:48,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:48,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:48,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 14:47:48,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:47:48,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:47:48,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:48,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:47:48,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:47:48,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:47:48,288 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2018-11-18 14:47:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:48,335 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2018-11-18 14:47:48,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:47:48,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-18 14:47:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:48,336 INFO L225 Difference]: With dead ends: 428 [2018-11-18 14:47:48,336 INFO L226 Difference]: Without dead ends: 229 [2018-11-18 14:47:48,337 INFO L604 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-11-18 14:47:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-18 14:47:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-11-18 14:47:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-18 14:47:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2018-11-18 14:47:48,344 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2018-11-18 14:47:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:48,344 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2018-11-18 14:47:48,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:47:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2018-11-18 14:47:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:47:48,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:48,345 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-11-18 14:47:48,345 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:48,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:48,346 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-11-18 14:47:48,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:48,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:48,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 14:47:48,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:47:48,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:47:48,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:47:48,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:47:48,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:47:48,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:47:48,380 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2018-11-18 14:47:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:48,401 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2018-11-18 14:47:48,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:47:48,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 14:47:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:48,403 INFO L225 Difference]: With dead ends: 309 [2018-11-18 14:47:48,403 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 14:47:48,403 INFO L604 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-11-18 14:47:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 14:47:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-18 14:47:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 14:47:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-18 14:47:48,408 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2018-11-18 14:47:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:48,408 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-18 14:47:48,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:47:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-18 14:47:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 14:47:48,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:48,411 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-11-18 14:47:48,411 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:48,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:48,411 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-11-18 14:47:48,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:48,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:48,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:48,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:48,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:47:48,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:48,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:48,474 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-18 14:47:48,474 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-11-18 14:47:48,476 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:48,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:48,553 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:48,554 INFO L272 AbstractInterpreter]: Visited 39 different actions 50 times. Merged at 7 different actions 8 times. Never widened. Performed 571 root evaluator evaluations with a maximum evaluation depth of 10. Performed 571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 5 fixpoints after 4 different actions. Largest state had 46 variables. [2018-11-18 14:47:48,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:48,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:48,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:48,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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-11-18 14:47:48,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:48,565 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:48,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:48,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:48,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:48,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-11-18 14:47:48,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:48,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:47:48,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:47:48,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:47:48,730 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 9 states. [2018-11-18 14:47:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:48,790 INFO L93 Difference]: Finished difference Result 190 states and 264 transitions. [2018-11-18 14:47:48,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:47:48,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-18 14:47:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:48,792 INFO L225 Difference]: With dead ends: 190 [2018-11-18 14:47:48,792 INFO L226 Difference]: Without dead ends: 186 [2018-11-18 14:47:48,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:47:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-18 14:47:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2018-11-18 14:47:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 14:47:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2018-11-18 14:47:48,800 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 51 [2018-11-18 14:47:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:48,800 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2018-11-18 14:47:48,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:47:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2018-11-18 14:47:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 14:47:48,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:48,801 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, 1, 1, 1, 1] [2018-11-18 14:47:48,801 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:48,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:48,801 INFO L82 PathProgramCache]: Analyzing trace with hash 412447638, now seen corresponding path program 1 times [2018-11-18 14:47:48,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:48,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:48,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:48,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:48,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:49,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:49,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:49,161 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-18 14:47:49,162 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], [452], [467], [482], [497], [500], [503], [506], [520], [523], [524], [525] [2018-11-18 14:47:49,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:49,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:49,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:49,353 INFO L272 AbstractInterpreter]: Visited 43 different actions 137 times. Merged at 35 different actions 82 times. Widened at 1 different actions 1 times. Performed 1640 root evaluator evaluations with a maximum evaluation depth of 11. Performed 1640 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 14 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-18 14:47:49,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:49,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:49,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:49,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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-11-18 14:47:49,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:49,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:49,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:49,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 14:47:49,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:49,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2018-11-18 14:47:49,611 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:49,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:47:49,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:47:49,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:47:49,612 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand 9 states. [2018-11-18 14:47:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:49,816 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-11-18 14:47:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:47:49,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-18 14:47:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:49,818 INFO L225 Difference]: With dead ends: 194 [2018-11-18 14:47:49,818 INFO L226 Difference]: Without dead ends: 192 [2018-11-18 14:47:49,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-18 14:47:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-18 14:47:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-11-18 14:47:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 14:47:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2018-11-18 14:47:49,825 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 55 [2018-11-18 14:47:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:49,826 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2018-11-18 14:47:49,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:47:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2018-11-18 14:47:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 14:47:49,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:49,826 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-11-18 14:47:49,827 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:49,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-11-18 14:47:49,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:49,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:49,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:49,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:49,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:52,282 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 194 DAG size of output: 36 [2018-11-18 14:47:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:52,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:52,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:52,291 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-18 14:47:52,291 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-11-18 14:47:52,293 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:52,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:52,382 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:52,382 INFO L272 AbstractInterpreter]: Visited 44 different actions 57 times. Merged at 9 different actions 10 times. Never widened. Performed 642 root evaluator evaluations with a maximum evaluation depth of 10. Performed 642 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 6 fixpoints after 5 different actions. Largest state had 50 variables. [2018-11-18 14:47:52,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:52,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:52,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:52,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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-11-18 14:47:52,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:52,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:52,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:52,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 14:47:52,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:52,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2018-11-18 14:47:52,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:52,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:47:52,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:47:52,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-18 14:47:52,908 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand 11 states. [2018-11-18 14:47:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:53,239 INFO L93 Difference]: Finished difference Result 187 states and 260 transitions. [2018-11-18 14:47:53,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:47:53,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-11-18 14:47:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:53,240 INFO L225 Difference]: With dead ends: 187 [2018-11-18 14:47:53,240 INFO L226 Difference]: Without dead ends: 185 [2018-11-18 14:47:53,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:47:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-18 14:47:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-11-18 14:47:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 14:47:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 255 transitions. [2018-11-18 14:47:53,249 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 255 transitions. Word has length 61 [2018-11-18 14:47:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:53,250 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 255 transitions. [2018-11-18 14:47:53,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:47:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 255 transitions. [2018-11-18 14:47:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 14:47:53,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:53,250 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-11-18 14:47:53,251 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:53,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-11-18 14:47:53,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:53,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:53,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:53,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:53,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:53,600 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-18 14:47:53,600 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-11-18 14:47:53,601 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:53,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:53,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:53,846 INFO L272 AbstractInterpreter]: Visited 44 different actions 140 times. Merged at 35 different actions 82 times. Widened at 1 different actions 1 times. Performed 1730 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1730 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 17 fixpoints after 9 different actions. Largest state had 50 variables. [2018-11-18 14:47:53,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:53,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:53,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:53,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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-11-18 14:47:53,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:53,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:53,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:53,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:54,010 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:47:54,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:54,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 13 [2018-11-18 14:47:54,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:54,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:47:54,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:47:54,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:47:54,027 INFO L87 Difference]: Start difference. First operand 182 states and 255 transitions. Second operand 9 states. [2018-11-18 14:47:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:54,103 INFO L93 Difference]: Finished difference Result 203 states and 284 transitions. [2018-11-18 14:47:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:47:54,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-11-18 14:47:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:54,105 INFO L225 Difference]: With dead ends: 203 [2018-11-18 14:47:54,105 INFO L226 Difference]: Without dead ends: 200 [2018-11-18 14:47:54,105 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:47:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-18 14:47:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-11-18 14:47:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 14:47:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 280 transitions. [2018-11-18 14:47:54,111 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 280 transitions. Word has length 70 [2018-11-18 14:47:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:54,111 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 280 transitions. [2018-11-18 14:47:54,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:47:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 280 transitions. [2018-11-18 14:47:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:47:54,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:54,112 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-11-18 14:47:54,112 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:54,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:54,113 INFO L82 PathProgramCache]: Analyzing trace with hash 564297596, now seen corresponding path program 1 times [2018-11-18 14:47:54,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:54,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:54,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:47:54,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:54,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:54,215 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-11-18 14:47:54,216 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-11-18 14:47:54,217 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:54,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:54,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:54,266 INFO L272 AbstractInterpreter]: Visited 46 different actions 57 times. Merged at 7 different actions 8 times. Never widened. Performed 630 root evaluator evaluations with a maximum evaluation depth of 10. Performed 630 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 6 fixpoints after 5 different actions. Largest state had 50 variables. [2018-11-18 14:47:54,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:54,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:54,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:54,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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-11-18 14:47:54,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:54,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:54,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:47:54,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 14:47:54,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:54,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2018-11-18 14:47:54,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:54,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 14:47:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:47:54,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:47:54,486 INFO L87 Difference]: Start difference. First operand 200 states and 280 transitions. Second operand 7 states. [2018-11-18 14:47:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:54,544 INFO L93 Difference]: Finished difference Result 224 states and 311 transitions. [2018-11-18 14:47:54,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:47:54,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-18 14:47:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:54,545 INFO L225 Difference]: With dead ends: 224 [2018-11-18 14:47:54,545 INFO L226 Difference]: Without dead ends: 221 [2018-11-18 14:47:54,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:47:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-18 14:47:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-11-18 14:47:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-18 14:47:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2018-11-18 14:47:54,552 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 79 [2018-11-18 14:47:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:54,552 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2018-11-18 14:47:54,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 14:47:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2018-11-18 14:47:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 14:47:54,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:54,553 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-11-18 14:47:54,553 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:54,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:54,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1030800333, now seen corresponding path program 1 times [2018-11-18 14:47:54,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:54,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:54,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:54,892 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 40 [2018-11-18 14:47:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:54,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:54,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:54,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-11-18 14:47:54,920 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-11-18 14:47:54,921 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:54,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:55,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:55,055 INFO L272 AbstractInterpreter]: Visited 44 different actions 104 times. Merged at 35 different actions 50 times. Never widened. Performed 1455 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1455 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-18 14:47:55,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:55,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:55,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:55,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/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-11-18 14:47:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:55,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:55,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:55,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 14:47:55,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:55,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2018-11-18 14:47:55,582 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:55,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:47:55,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:47:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:47:55,582 INFO L87 Difference]: Start difference. First operand 218 states and 305 transitions. Second operand 11 states. [2018-11-18 14:47:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:55,740 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2018-11-18 14:47:55,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 14:47:55,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-11-18 14:47:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:55,741 INFO L225 Difference]: With dead ends: 221 [2018-11-18 14:47:55,741 INFO L226 Difference]: Without dead ends: 219 [2018-11-18 14:47:55,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:47:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-18 14:47:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-18 14:47:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-18 14:47:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 306 transitions. [2018-11-18 14:47:55,750 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 306 transitions. Word has length 82 [2018-11-18 14:47:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:55,750 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 306 transitions. [2018-11-18 14:47:55,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:47:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 306 transitions. [2018-11-18 14:47:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 14:47:55,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:55,751 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-11-18 14:47:55,751 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:55,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash 644642791, now seen corresponding path program 1 times [2018-11-18 14:47:55,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:55,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:55,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:55,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:55,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:47:55,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:55,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:55,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-11-18 14:47:55,873 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-11-18 14:47:55,874 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:55,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:56,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:56,065 INFO L272 AbstractInterpreter]: Visited 46 different actions 111 times. Merged at 37 different actions 55 times. Never widened. Performed 1404 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1404 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-18 14:47:56,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:56,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:56,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:56,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:47:56,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:56,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:56,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:56,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 14:47:56,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:56,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 19 [2018-11-18 14:47:56,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:56,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 14:47:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 14:47:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:47:56,351 INFO L87 Difference]: Start difference. First operand 219 states and 306 transitions. Second operand 15 states. [2018-11-18 14:47:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:56,499 INFO L93 Difference]: Finished difference Result 264 states and 367 transitions. [2018-11-18 14:47:56,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:47:56,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-18 14:47:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:56,501 INFO L225 Difference]: With dead ends: 264 [2018-11-18 14:47:56,501 INFO L226 Difference]: Without dead ends: 260 [2018-11-18 14:47:56,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:47:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-18 14:47:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2018-11-18 14:47:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 14:47:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2018-11-18 14:47:56,511 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 93 [2018-11-18 14:47:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:56,512 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2018-11-18 14:47:56,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 14:47:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2018-11-18 14:47:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 14:47:56,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:56,513 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:47:56,516 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:56,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:56,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1152837687, now seen corresponding path program 1 times [2018-11-18 14:47:56,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:56,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:56,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:56,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:56,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:58,797 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 82 DAG size of output: 28 [2018-11-18 14:47:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 20 proven. 134 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:47:58,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:58,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:47:58,811 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-18 14:47:58,811 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], [452], [467], [482], [497], [500], [503], [506], [508], [520], [523], [524], [525] [2018-11-18 14:47:58,812 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:47:58,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:47:59,000 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:47:59,001 INFO L272 AbstractInterpreter]: Visited 44 different actions 104 times. Merged at 35 different actions 50 times. Never widened. Performed 1449 root evaluator evaluations with a maximum evaluation depth of 11. Performed 1449 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-18 14:47:59,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:59,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:47:59,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:47:59,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:47:59,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:59,043 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:47:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:59,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 16 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:59,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:47:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 34 proven. 88 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 14:47:59,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:47:59,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 26 [2018-11-18 14:47:59,448 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:47:59,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 14:47:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 14:47:59,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-18 14:47:59,449 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand 20 states. [2018-11-18 14:47:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:47:59,747 INFO L93 Difference]: Finished difference Result 270 states and 371 transitions. [2018-11-18 14:47:59,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 14:47:59,748 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-18 14:47:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:47:59,749 INFO L225 Difference]: With dead ends: 270 [2018-11-18 14:47:59,749 INFO L226 Difference]: Without dead ends: 268 [2018-11-18 14:47:59,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 14:47:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-18 14:47:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 255. [2018-11-18 14:47:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 14:47:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 357 transitions. [2018-11-18 14:47:59,756 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 357 transitions. Word has length 97 [2018-11-18 14:47:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:47:59,756 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 357 transitions. [2018-11-18 14:47:59,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 14:47:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 357 transitions. [2018-11-18 14:47:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 14:47:59,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:47:59,757 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-11-18 14:47:59,758 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:47:59,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:59,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1306502892, now seen corresponding path program 2 times [2018-11-18 14:47:59,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:47:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:59,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:47:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:47:59,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:47:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:48:00,220 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 39 [2018-11-18 14:48:00,422 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 36 [2018-11-18 14:48:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:48:00,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:48:00,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:48:00,437 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 14:48:00,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 14:48:00,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:48:00,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:48:00,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:48:00,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 14:48:00,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 14:48:00,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:48:00,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:48:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 14:48:00,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:48:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 14:48:01,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:48:01,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 23 [2018-11-18 14:48:01,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:48:01,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 14:48:01,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 14:48:01,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-11-18 14:48:01,183 INFO L87 Difference]: Start difference. First operand 255 states and 357 transitions. Second operand 19 states. [2018-11-18 14:48:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:48:01,683 INFO L93 Difference]: Finished difference Result 269 states and 372 transitions. [2018-11-18 14:48:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 14:48:01,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 103 [2018-11-18 14:48:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:48:01,684 INFO L225 Difference]: With dead ends: 269 [2018-11-18 14:48:01,684 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 14:48:01,684 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=1449, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 14:48:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 14:48:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 14:48:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 14:48:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:48:01,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-11-18 14:48:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:48:01,685 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:48:01,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 14:48:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:48:01,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 14:48:01,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 14:48:01,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:01,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:48:02,025 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46 [2018-11-18 14:48:02,102 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:48:02,102 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:48:02,102 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:48:02,102 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 14:48:02,103 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-11-18 14:48:02,103 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-11-18 14:48:02,104 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-11-18 14:48:02,105 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L421 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-11-18 14:48:02,106 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-11-18 14:48:02,106 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 24 561) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-11-18 14:48:02,107 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L421 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse5 (exists ((main_~P1~0 Int)) (let ((.cse9 (mod main_~P1~0 2))) (and (= .cse9 0) (= .cse9 (mod (+ main_~this_expect~0 1) 2)))))) (.cse1 (<= main_~this_buffer_empty~0 1)) (.cse3 (<= 1 main_~this_buffer_empty~0)) (.cse0 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse2 (<= 0 (+ main_~P8~0 2147483648))) (.cse4 (<= main_~P8~0 2147483647)) (.cse6 (<= main_~this_buffer_empty~0 0)) (.cse7 (<= 0 main_~this_buffer_empty~0))) (or (and .cse0 (and (= main_~q~0 1) .cse1 .cse2 .cse3 .cse4)) (and .cse5 (and .cse2 (= main_~q~0 3) .cse4 .cse6 .cse7)) (and .cse5 .cse1 .cse2 (= main_~q~0 4) .cse3 .cse4) (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse6 .cse7) (and .cse0 (<= 5 main_~q~0) .cse2 .cse4 .cse6 .cse7))) [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-11-18 14:48:02,108 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-11-18 14:48:02,109 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-11-18 14:48:02,110 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-11-18 14:48:02,110 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-18 14:48:02,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,116 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,116 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:48:02 BoogieIcfgContainer [2018-11-18 14:48:02,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:48:02,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:48:02,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:48:02,127 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:48:02,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:47:43" (3/4) ... [2018-11-18 14:48:02,131 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 14:48:02,136 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 14:48:02,136 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 14:48:02,148 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-18 14:48:02,148 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 14:48:02,167 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) [2018-11-18 14:48:02,175 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2df873cc-08ab-4a8c-bdd1-c4e171747c76/bin-2019/utaipan/witness.graphml [2018-11-18 14:48:02,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:48:02,175 INFO L168 Benchmark]: Toolchain (without parser) took 19507.29 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 440.9 MB). Free memory was 963.4 MB in the beginning and 1.2 GB in the end (delta: -214.6 MB). Peak memory consumption was 226.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:48:02,176 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:48:02,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.79 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:48:02,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:48:02,179 INFO L168 Benchmark]: Boogie Preprocessor took 38.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:48:02,179 INFO L168 Benchmark]: RCFGBuilder took 655.15 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:48:02,179 INFO L168 Benchmark]: TraceAbstraction took 18431.15 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.3 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:48:02,180 INFO L168 Benchmark]: Witness Printer took 47.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 191.4 kB). Peak memory consumption was 191.4 kB. Max. memory is 11.5 GB. [2018-11-18 14:48:02,184 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.79 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 655.15 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18431.15 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 305.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.3 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. * Witness Printer took 47.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 191.4 kB). Peak memory consumption was 191.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-11-18 14:48:02,187 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,187 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,187 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,187 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,187 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,187 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,187 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,188 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,188 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,188 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,189 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,189 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,189 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,189 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,189 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,189 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) && (((q == 1 && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647) || ((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && (((0 <= P8 + 2147483648 && q == 3) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && q == 4) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((this_expect <= 0 && 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) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2018-11-18 14:48:02,190 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,190 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,190 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-18 14:48:02,190 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 18.3s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 3825 SDtfs, 2440 SDslu, 14747 SDs, 0 SdLazy, 2432 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1883 GetRequests, 1660 SyntacticMatches, 22 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 13 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 91 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 38 NumberOfFragments, 205 HoareAnnotationTreeSize, 7 FomulaSimplifications, 5604 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 821 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 1955 NumberOfCodeBlocks, 1913 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2758 ConstructedInterpolants, 297 QuantifiedInterpolants, 2337275 SizeOfPredicates, 73 NumberOfNonLiveVariables, 5546 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 51 InterpolantComputations, 11 PerfectInterpolantSequences, 1092/2998 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...