./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-new/nested_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-new/nested_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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 a881e1073186594f4727f809fbe5d917ff145543 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:34:35,542 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:34:35,543 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:34:35,551 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:34:35,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:34:35,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:34:35,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:34:35,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:34:35,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:34:35,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:34:35,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:34:35,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:34:35,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:34:35,557 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:34:35,558 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:34:35,558 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:34:35,559 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:34:35,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:34:35,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:34:35,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:34:35,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:34:35,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:34:35,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:34:35,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:34:35,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:34:35,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:34:35,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:34:35,568 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:34:35,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:34:35,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:34:35,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:34:35,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:34:35,570 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:34:35,570 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:34:35,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:34:35,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:34:35,571 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:34:35,581 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:34:35,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:34:35,581 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:34:35,582 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:34:35,582 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:34:35,582 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:34:35,582 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:34:35,582 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:34:35,582 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:34:35,582 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:34:35,582 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:34:35,583 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:34:35,583 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:34:35,583 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:34:35,583 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:34:35,583 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:34:35,583 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:34:35,584 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:34:35,584 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:34:35,584 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:34:35,584 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:34:35,584 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:34:35,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:34:35,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:34:35,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:34:35,585 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:34:35,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:34:35,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:34:35,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:34:35,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:34:35,585 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:34:35,585 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:34:35,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:34:35,585 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:34:35,585 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_c0d43bc6-d731-458f-8d54-d13aa0276b30/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 -> a881e1073186594f4727f809fbe5d917ff145543 [2018-11-10 13:34:35,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:34:35,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:34:35,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:34:35,620 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:34:35,620 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:34:35,621 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/../../sv-benchmarks/c/loop-new/nested_true-unreach-call_true-termination.i [2018-11-10 13:34:35,659 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/data/8efc369a8/cf6231858afd452ca08743fb8b39e930/FLAG5dba32dab [2018-11-10 13:34:35,974 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:34:35,975 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/sv-benchmarks/c/loop-new/nested_true-unreach-call_true-termination.i [2018-11-10 13:34:35,979 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/data/8efc369a8/cf6231858afd452ca08743fb8b39e930/FLAG5dba32dab [2018-11-10 13:34:35,991 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/data/8efc369a8/cf6231858afd452ca08743fb8b39e930 [2018-11-10 13:34:35,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:34:35,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:34:35,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:34:35,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:34:35,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:34:35,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:34:35" (1/1) ... [2018-11-10 13:34:36,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac897aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36, skipping insertion in model container [2018-11-10 13:34:36,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:34:35" (1/1) ... [2018-11-10 13:34:36,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:34:36,025 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:34:36,145 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:34:36,148 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:34:36,161 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:34:36,171 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:34:36,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36 WrapperNode [2018-11-10 13:34:36,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:34:36,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:34:36,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:34:36,172 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:34:36,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... [2018-11-10 13:34:36,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... [2018-11-10 13:34:36,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:34:36,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:34:36,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:34:36,183 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:34:36,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... [2018-11-10 13:34:36,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... [2018-11-10 13:34:36,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... [2018-11-10 13:34:36,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... [2018-11-10 13:34:36,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... [2018-11-10 13:34:36,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... [2018-11-10 13:34:36,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... [2018-11-10 13:34:36,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:34:36,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:34:36,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:34:36,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:34:36,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:34:36,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:34:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:34:36,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:34:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:34:36,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:34:36,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 13:34:36,270 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 13:34:36,365 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:34:36,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:34:36 BoogieIcfgContainer [2018-11-10 13:34:36,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:34:36,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:34:36,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:34:36,368 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:34:36,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:34:35" (1/3) ... [2018-11-10 13:34:36,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f710f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:34:36, skipping insertion in model container [2018-11-10 13:34:36,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:34:36" (2/3) ... [2018-11-10 13:34:36,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f710f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:34:36, skipping insertion in model container [2018-11-10 13:34:36,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:34:36" (3/3) ... [2018-11-10 13:34:36,370 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call_true-termination.i [2018-11-10 13:34:36,376 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:34:36,380 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:34:36,388 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:34:36,405 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:34:36,405 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:34:36,405 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:34:36,405 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:34:36,406 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:34:36,406 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:34:36,406 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:34:36,406 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:34:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-10 13:34:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 13:34:36,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:36,422 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:36,423 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:36,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash -702630595, now seen corresponding path program 1 times [2018-11-10 13:34:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:36,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:36,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:36,494 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-10 13:34:36,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:36,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:34:36,495 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:34:36,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:34:36,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:34:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:34:36,507 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-10 13:34:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:36,521 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-10 13:34:36,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:34:36,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-10 13:34:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:36,529 INFO L225 Difference]: With dead ends: 43 [2018-11-10 13:34:36,529 INFO L226 Difference]: Without dead ends: 18 [2018-11-10 13:34:36,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:34:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-10 13:34:36,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-10 13:34:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 13:34:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-10 13:34:36,551 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2018-11-10 13:34:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:36,552 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-10 13:34:36,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:34:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-10 13:34:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 13:34:36,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:36,553 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:36,553 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:36,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:36,553 INFO L82 PathProgramCache]: Analyzing trace with hash -972126638, now seen corresponding path program 1 times [2018-11-10 13:34:36,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:36,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:36,554 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:36,608 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-10 13:34:36,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:36,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:36,609 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:34:36,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:36,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:36,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:36,611 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2018-11-10 13:34:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:36,638 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-10 13:34:36,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:36,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 13:34:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:36,639 INFO L225 Difference]: With dead ends: 29 [2018-11-10 13:34:36,639 INFO L226 Difference]: Without dead ends: 24 [2018-11-10 13:34:36,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-10 13:34:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-11-10 13:34:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 13:34:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-10 13:34:36,643 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-11-10 13:34:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:36,644 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 13:34:36,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-10 13:34:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 13:34:36,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:36,644 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:36,644 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:36,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:36,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1998515670, now seen corresponding path program 1 times [2018-11-10 13:34:36,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:36,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:36,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:36,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:36,645 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:36,678 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-10 13:34:36,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:36,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:36,679 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:34:36,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:36,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:36,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:36,680 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2018-11-10 13:34:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:36,715 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-10 13:34:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:36,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-10 13:34:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:36,716 INFO L225 Difference]: With dead ends: 34 [2018-11-10 13:34:36,716 INFO L226 Difference]: Without dead ends: 23 [2018-11-10 13:34:36,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-10 13:34:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-10 13:34:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 13:34:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-10 13:34:36,721 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2018-11-10 13:34:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:36,721 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-10 13:34:36,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-10 13:34:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 13:34:36,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:36,722 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:36,722 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:36,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1293803971, now seen corresponding path program 1 times [2018-11-10 13:34:36,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:36,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:36,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:36,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:36,765 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:36,765 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-10 13:34:36,767 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [21], [25], [28], [30], [32], [36], [43], [46], [48], [54], [55], [56], [58] [2018-11-10 13:34:36,804 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:34:36,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:34:37,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:34:37,366 INFO L272 AbstractInterpreter]: Visited 19 different actions 599 times. Merged at 8 different actions 374 times. Widened at 3 different actions 105 times. Found 61 fixpoints after 6 different actions. Largest state had 10 variables. [2018-11-10 13:34:37,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:37,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:34:37,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:37,377 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:37,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:37,384 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:34:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:37,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:37,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:37,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:37,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-10 13:34:37,516 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:37,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:34:37,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:34:37,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:37,517 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2018-11-10 13:34:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:37,548 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-10 13:34:37,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:34:37,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-10 13:34:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:37,549 INFO L225 Difference]: With dead ends: 39 [2018-11-10 13:34:37,549 INFO L226 Difference]: Without dead ends: 26 [2018-11-10 13:34:37,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-10 13:34:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-10 13:34:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 13:34:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-10 13:34:37,553 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2018-11-10 13:34:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:37,554 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 13:34:37,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:34:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-10 13:34:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 13:34:37,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:37,554 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:37,555 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:37,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1379909750, now seen corresponding path program 2 times [2018-11-10 13:34:37,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:37,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:37,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:37,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:37,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:37,621 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:37,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:37,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:37,622 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:37,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:34:37,628 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:34:37,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 13:34:37,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:37,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:34:37,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:34:37,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:37,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2018-11-10 13:34:37,723 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:37,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:34:37,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:34:37,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:34:37,724 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-11-10 13:34:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:37,926 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-10 13:34:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 13:34:37,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-10 13:34:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:37,927 INFO L225 Difference]: With dead ends: 73 [2018-11-10 13:34:37,928 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 13:34:37,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=363, Unknown=0, NotChecked=0, Total=552 [2018-11-10 13:34:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 13:34:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-11-10 13:34:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 13:34:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-10 13:34:37,934 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2018-11-10 13:34:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:37,934 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-10 13:34:37,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:34:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-10 13:34:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 13:34:37,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:37,935 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:37,936 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:37,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1699386968, now seen corresponding path program 3 times [2018-11-10 13:34:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:37,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:37,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:34:37,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:37,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:37,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:37,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:37,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:37,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:37,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:34:37,995 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:34:38,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:34:38,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:38,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:34:38,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:34:38,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:38,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-10 13:34:38,138 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:38,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:34:38,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:34:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:34:38,139 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2018-11-10 13:34:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:38,166 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-10 13:34:38,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:34:38,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-10 13:34:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:38,167 INFO L225 Difference]: With dead ends: 72 [2018-11-10 13:34:38,167 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 13:34:38,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:34:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 13:34:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-10 13:34:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 13:34:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-10 13:34:38,175 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2018-11-10 13:34:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:38,175 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-10 13:34:38,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:34:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-10 13:34:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 13:34:38,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:38,176 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:38,176 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:38,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:38,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1734727982, now seen corresponding path program 4 times [2018-11-10 13:34:38,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:38,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:38,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:38,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:38,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 13:34:38,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:38,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:38,250 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:38,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:38,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:38,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:38,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:38,256 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:34:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:38,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 13:34:38,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 13:34:38,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:38,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-11-10 13:34:38,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:38,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:34:38,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:34:38,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:34:38,383 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2018-11-10 13:34:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:38,403 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-10 13:34:38,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:34:38,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-11-10 13:34:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:38,404 INFO L225 Difference]: With dead ends: 81 [2018-11-10 13:34:38,404 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 13:34:38,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:34:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 13:34:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-10 13:34:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 13:34:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-10 13:34:38,408 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2018-11-10 13:34:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:38,409 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-10 13:34:38,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:34:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-10 13:34:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 13:34:38,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:38,410 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:38,410 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:38,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2050902056, now seen corresponding path program 5 times [2018-11-10 13:34:38,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:38,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:38,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:38,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:38,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 101 proven. 40 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 13:34:38,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:38,470 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:38,470 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:38,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:38,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:38,470 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:38,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:34:38,477 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:34:38,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 13:34:38,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:38,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 13:34:38,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 13:34:38,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:38,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2018-11-10 13:34:38,590 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:38,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:34:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:34:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-10 13:34:38,591 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 13 states. [2018-11-10 13:34:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:38,930 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-11-10 13:34:38,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 13:34:38,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-11-10 13:34:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:38,931 INFO L225 Difference]: With dead ends: 136 [2018-11-10 13:34:38,931 INFO L226 Difference]: Without dead ends: 108 [2018-11-10 13:34:38,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=649, Invalid=1331, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 13:34:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-10 13:34:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 83. [2018-11-10 13:34:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 13:34:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-11-10 13:34:38,938 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 53 [2018-11-10 13:34:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:38,938 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-11-10 13:34:38,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:34:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-10 13:34:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 13:34:38,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:38,939 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 18, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:38,939 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:38,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1138844106, now seen corresponding path program 6 times [2018-11-10 13:34:38,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:38,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:38,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-10 13:34:38,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:38,992 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:38,992 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:38,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:38,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:38,992 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:38,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:34:38,997 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:34:39,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:34:39,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:39,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-10 13:34:39,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-10 13:34:39,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:39,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-11-10 13:34:39,163 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:39,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 13:34:39,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 13:34:39,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-11-10 13:34:39,163 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 17 states. [2018-11-10 13:34:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:39,196 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-11-10 13:34:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:34:39,197 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-11-10 13:34:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:39,197 INFO L225 Difference]: With dead ends: 149 [2018-11-10 13:34:39,197 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 13:34:39,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-11-10 13:34:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 13:34:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-11-10 13:34:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 13:34:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-10 13:34:39,207 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 82 [2018-11-10 13:34:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:39,208 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-10 13:34:39,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 13:34:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-10 13:34:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 13:34:39,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:39,209 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:39,209 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:39,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:39,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2009672909, now seen corresponding path program 7 times [2018-11-10 13:34:39,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:39,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:39,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:39,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:39,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-11-10 13:34:39,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:39,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:39,293 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:39,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:39,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:39,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:39,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:39,304 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:34:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:39,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-11-10 13:34:39,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-11-10 13:34:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-11-10 13:34:39,500 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:39,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 13:34:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 13:34:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:34:39,501 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 19 states. [2018-11-10 13:34:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:39,540 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2018-11-10 13:34:39,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:34:39,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2018-11-10 13:34:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:39,541 INFO L225 Difference]: With dead ends: 164 [2018-11-10 13:34:39,542 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 13:34:39,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:34:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 13:34:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-10 13:34:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 13:34:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-11-10 13:34:39,551 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 91 [2018-11-10 13:34:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:39,551 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-11-10 13:34:39,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 13:34:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-11-10 13:34:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 13:34:39,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:39,553 INFO L375 BasicCegarLoop]: trace histogram [27, 24, 24, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:39,554 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:39,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1289095638, now seen corresponding path program 8 times [2018-11-10 13:34:39,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:39,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:39,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:39,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:39,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 458 proven. 100 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-10 13:34:39,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:39,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:39,635 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:39,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:39,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:39,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:39,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:34:39,641 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:34:39,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 13:34:39,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:39,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 460 proven. 100 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-11-10 13:34:39,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 8 proven. 552 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-11-10 13:34:39,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:39,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-10 13:34:39,837 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:39,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 13:34:39,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 13:34:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:34:39,838 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 21 states. [2018-11-10 13:34:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:39,876 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-11-10 13:34:39,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:34:39,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2018-11-10 13:34:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:39,878 INFO L225 Difference]: With dead ends: 179 [2018-11-10 13:34:39,878 INFO L226 Difference]: Without dead ends: 113 [2018-11-10 13:34:39,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 182 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:34:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-10 13:34:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-11-10 13:34:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 13:34:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-11-10 13:34:39,888 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 100 [2018-11-10 13:34:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:39,888 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-11-10 13:34:39,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 13:34:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-11-10 13:34:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 13:34:39,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:39,890 INFO L375 BasicCegarLoop]: trace histogram [30, 27, 27, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:39,890 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:39,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -340366701, now seen corresponding path program 9 times [2018-11-10 13:34:39,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:39,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:39,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-11-10 13:34:39,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:39,981 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:39,981 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:39,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:39,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:39,981 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:39,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:34:39,987 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:34:40,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:34:40,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:40,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-11-10 13:34:40,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-11-10 13:34:40,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:40,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-11-10 13:34:40,176 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:40,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 13:34:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 13:34:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:34:40,177 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 23 states. [2018-11-10 13:34:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:40,230 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-11-10 13:34:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 13:34:40,230 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 109 [2018-11-10 13:34:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:40,231 INFO L225 Difference]: With dead ends: 194 [2018-11-10 13:34:40,231 INFO L226 Difference]: Without dead ends: 122 [2018-11-10 13:34:40,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 198 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2018-11-10 13:34:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-10 13:34:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-11-10 13:34:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 13:34:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-11-10 13:34:40,241 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 109 [2018-11-10 13:34:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:40,241 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-11-10 13:34:40,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 13:34:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-10 13:34:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 13:34:40,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:40,242 INFO L375 BasicCegarLoop]: trace histogram [33, 30, 30, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:40,242 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:40,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2030161270, now seen corresponding path program 10 times [2018-11-10 13:34:40,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:40,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:40,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:40,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:40,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-10 13:34:40,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:40,330 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:40,330 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:40,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:40,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:40,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:40,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:40,340 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:34:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:40,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-10 13:34:40,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-10 13:34:40,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:40,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-10 13:34:40,475 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:40,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:34:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:34:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:34:40,476 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 11 states. [2018-11-10 13:34:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:40,498 INFO L93 Difference]: Finished difference Result 192 states and 197 transitions. [2018-11-10 13:34:40,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:34:40,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-11-10 13:34:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:40,499 INFO L225 Difference]: With dead ends: 192 [2018-11-10 13:34:40,499 INFO L226 Difference]: Without dead ends: 187 [2018-11-10 13:34:40,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:34:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-10 13:34:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2018-11-10 13:34:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 13:34:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-11-10 13:34:40,510 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 118 [2018-11-10 13:34:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:40,510 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-11-10 13:34:40,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:34:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-10 13:34:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 13:34:40,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:40,513 INFO L375 BasicCegarLoop]: trace histogram [44, 40, 40, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:40,513 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:40,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash -969563822, now seen corresponding path program 11 times [2018-11-10 13:34:40,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:40,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:40,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-11-10 13:34:40,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:40,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:40,635 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:40,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:40,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:40,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:40,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:34:40,645 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:34:40,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-10 13:34:40,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:40,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-11-10 13:34:40,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-11-10 13:34:40,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:40,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-11-10 13:34:40,897 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:40,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:34:40,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:34:40,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:34:40,898 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 13 states. [2018-11-10 13:34:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:40,927 INFO L93 Difference]: Finished difference Result 227 states and 233 transitions. [2018-11-10 13:34:40,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:34:40,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2018-11-10 13:34:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:40,929 INFO L225 Difference]: With dead ends: 227 [2018-11-10 13:34:40,929 INFO L226 Difference]: Without dead ends: 222 [2018-11-10 13:34:40,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:34:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-10 13:34:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 189. [2018-11-10 13:34:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 13:34:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2018-11-10 13:34:40,937 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 153 [2018-11-10 13:34:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:40,938 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2018-11-10 13:34:40,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:34:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2018-11-10 13:34:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 13:34:40,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:40,939 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 50, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:40,939 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:40,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1779605514, now seen corresponding path program 12 times [2018-11-10 13:34:40,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:40,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:40,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:40,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:40,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-11-10 13:34:41,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:41,037 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:41,038 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:41,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:41,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:41,038 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:41,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:34:41,047 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:34:41,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:34:41,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:41,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-11-10 13:34:41,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-11-10 13:34:41,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:41,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-11-10 13:34:41,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:41,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 13:34:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 13:34:41,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-11-10 13:34:41,271 INFO L87 Difference]: Start difference. First operand 189 states and 194 transitions. Second operand 15 states. [2018-11-10 13:34:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:41,317 INFO L93 Difference]: Finished difference Result 262 states and 269 transitions. [2018-11-10 13:34:41,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:34:41,318 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2018-11-10 13:34:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:41,319 INFO L225 Difference]: With dead ends: 262 [2018-11-10 13:34:41,319 INFO L226 Difference]: Without dead ends: 257 [2018-11-10 13:34:41,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-11-10 13:34:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-10 13:34:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 224. [2018-11-10 13:34:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-10 13:34:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 230 transitions. [2018-11-10 13:34:41,340 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 230 transitions. Word has length 188 [2018-11-10 13:34:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:41,340 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 230 transitions. [2018-11-10 13:34:41,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 13:34:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 230 transitions. [2018-11-10 13:34:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-10 13:34:41,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:41,342 INFO L375 BasicCegarLoop]: trace histogram [66, 60, 60, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:41,342 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:41,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:41,342 INFO L82 PathProgramCache]: Analyzing trace with hash 388824786, now seen corresponding path program 13 times [2018-11-10 13:34:41,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:41,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:41,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:41,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:41,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-11-10 13:34:41,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:41,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:41,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:41,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:41,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:41,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:41,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:41,479 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:34:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:41,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-11-10 13:34:41,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-11-10 13:34:41,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:41,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-11-10 13:34:41,751 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:41,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 13:34:41,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 13:34:41,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-11-10 13:34:41,752 INFO L87 Difference]: Start difference. First operand 224 states and 230 transitions. Second operand 17 states. [2018-11-10 13:34:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:41,798 INFO L93 Difference]: Finished difference Result 297 states and 305 transitions. [2018-11-10 13:34:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:34:41,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 223 [2018-11-10 13:34:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:41,799 INFO L225 Difference]: With dead ends: 297 [2018-11-10 13:34:41,799 INFO L226 Difference]: Without dead ends: 292 [2018-11-10 13:34:41,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 432 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-11-10 13:34:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-10 13:34:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 259. [2018-11-10 13:34:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-10 13:34:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 266 transitions. [2018-11-10 13:34:41,813 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 266 transitions. Word has length 223 [2018-11-10 13:34:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:41,814 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 266 transitions. [2018-11-10 13:34:41,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 13:34:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 266 transitions. [2018-11-10 13:34:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-10 13:34:41,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:41,816 INFO L375 BasicCegarLoop]: trace histogram [77, 70, 70, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:41,816 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:41,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1062399370, now seen corresponding path program 14 times [2018-11-10 13:34:41,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:41,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:41,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-10 13:34:41,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:41,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:41,957 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:41,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:41,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:41,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/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-10 13:34:41,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:34:41,964 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:34:42,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-10 13:34:42,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:42,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-10 13:34:42,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-10 13:34:42,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:42,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-11-10 13:34:42,325 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:42,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 13:34:42,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 13:34:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:34:42,326 INFO L87 Difference]: Start difference. First operand 259 states and 266 transitions. Second operand 19 states. [2018-11-10 13:34:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:42,376 INFO L93 Difference]: Finished difference Result 332 states and 341 transitions. [2018-11-10 13:34:42,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:34:42,376 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 258 [2018-11-10 13:34:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:42,377 INFO L225 Difference]: With dead ends: 332 [2018-11-10 13:34:42,377 INFO L226 Difference]: Without dead ends: 327 [2018-11-10 13:34:42,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 500 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:34:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-10 13:34:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 294. [2018-11-10 13:34:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-10 13:34:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 302 transitions. [2018-11-10 13:34:42,399 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 302 transitions. Word has length 258 [2018-11-10 13:34:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:42,399 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 302 transitions. [2018-11-10 13:34:42,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 13:34:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 302 transitions. [2018-11-10 13:34:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-10 13:34:42,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:42,401 INFO L375 BasicCegarLoop]: trace histogram [88, 80, 80, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:42,401 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:42,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash -790873006, now seen corresponding path program 15 times [2018-11-10 13:34:42,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:42,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:42,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-11-10 13:34:42,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:42,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:42,630 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:42,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:42,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:42,630 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:34:42,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:34:42,639 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:34:42,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:34:42,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:34:42,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-11-10 13:34:42,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-11-10 13:34:43,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:43,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-10 13:34:43,082 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:43,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 13:34:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 13:34:43,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:34:43,083 INFO L87 Difference]: Start difference. First operand 294 states and 302 transitions. Second operand 21 states. [2018-11-10 13:34:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:43,176 INFO L93 Difference]: Finished difference Result 367 states and 377 transitions. [2018-11-10 13:34:43,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:34:43,176 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 293 [2018-11-10 13:34:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:43,177 INFO L225 Difference]: With dead ends: 367 [2018-11-10 13:34:43,177 INFO L226 Difference]: Without dead ends: 362 [2018-11-10 13:34:43,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 568 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:34:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-10 13:34:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 329. [2018-11-10 13:34:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-10 13:34:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 338 transitions. [2018-11-10 13:34:43,195 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 338 transitions. Word has length 293 [2018-11-10 13:34:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:43,195 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 338 transitions. [2018-11-10 13:34:43,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 13:34:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 338 transitions. [2018-11-10 13:34:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-10 13:34:43,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:43,197 INFO L375 BasicCegarLoop]: trace histogram [99, 90, 90, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:43,197 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:43,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash 547939574, now seen corresponding path program 16 times [2018-11-10 13:34:43,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:43,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:34:43,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:43,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-11-10 13:34:43,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:43,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:43,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:34:43,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:34:43,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:43,372 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:34:43,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:43,395 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:34:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:43,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-11-10 13:34:43,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:34:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-11-10 13:34:43,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:34:43,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-11-10 13:34:43,826 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:34:43,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 13:34:43,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 13:34:43,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-11-10 13:34:43,827 INFO L87 Difference]: Start difference. First operand 329 states and 338 transitions. Second operand 23 states. [2018-11-10 13:34:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:43,923 INFO L93 Difference]: Finished difference Result 402 states and 413 transitions. [2018-11-10 13:34:43,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 13:34:43,923 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 328 [2018-11-10 13:34:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:43,925 INFO L225 Difference]: With dead ends: 402 [2018-11-10 13:34:43,925 INFO L226 Difference]: Without dead ends: 397 [2018-11-10 13:34:43,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 636 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2018-11-10 13:34:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-10 13:34:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 364. [2018-11-10 13:34:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-10 13:34:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 374 transitions. [2018-11-10 13:34:43,950 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 374 transitions. Word has length 328 [2018-11-10 13:34:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:43,950 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 374 transitions. [2018-11-10 13:34:43,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 13:34:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 374 transitions. [2018-11-10 13:34:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-11-10 13:34:43,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:43,952 INFO L375 BasicCegarLoop]: trace histogram [110, 100, 100, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:43,952 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:43,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1390107090, now seen corresponding path program 17 times [2018-11-10 13:34:43,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:34:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:43,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:34:43,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:34:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 17095 backedges. 17077 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:34:46,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:46,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2018-11-10 13:34:46,778 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:34:46,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-11-10 13:34:46,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-11-10 13:34:46,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=5663, Unknown=0, NotChecked=0, Total=10920 [2018-11-10 13:34:46,780 INFO L87 Difference]: Start difference. First operand 364 states and 374 transitions. Second operand 105 states. [2018-11-10 13:34:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:48,289 INFO L93 Difference]: Finished difference Result 14899 states and 15359 transitions. [2018-11-10 13:34:48,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-11-10 13:34:48,289 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 363 [2018-11-10 13:34:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:48,290 INFO L225 Difference]: With dead ends: 14899 [2018-11-10 13:34:48,290 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:34:48,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2018-11-10 13:34:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:34:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:34:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:34:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:34:48,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 363 [2018-11-10 13:34:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:48,306 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:34:48,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-11-10 13:34:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:34:48,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:34:48,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:34:49,523 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-11-10 13:34:51,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:52,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:52,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:52,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:52,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:52,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:53,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:54,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:55,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:56,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:57,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:57,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:57,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:57,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:57,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:58,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:58,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:58,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:58,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:58,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:58,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:58,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:59,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:59,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:59,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:59,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:34:59,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:00,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:00,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:00,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:00,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:00,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:00,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:00,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:01,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:01,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:01,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:01,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:02,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:02,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:03,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:03,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:03,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:04,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:05,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:05,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:05,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:05,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:06,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:06,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:06,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:06,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:06,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:06,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:06,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:07,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:07,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:07,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:07,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:08,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:08,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:08,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:08,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:09,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:09,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:09,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:09,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:11,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:11,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:11,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:12,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:13,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:13,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:14,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:14,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:14,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:14,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:14,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:15,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:16,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:16,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:17,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:17,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:17,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:18,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:18,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:19,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:19,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:19,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:20,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:21,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:21,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:23,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:23,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:24,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:26,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:26,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:26,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:27,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:27,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:27,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:27,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:28,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:29,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:31,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:36,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:37,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:38,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:40,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:40,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:40,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:40,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:41,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:44,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:44,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:35:55,517 WARN L179 SmtUtils]: Spent 1.10 m on a formula simplification. DAG size of input: 5167 DAG size of output: 2220 [2018-11-10 13:35:58,821 WARN L179 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-11-10 13:36:46,909 WARN L179 SmtUtils]: Spent 48.08 s on a formula simplification. DAG size of input: 2199 DAG size of output: 362 [2018-11-10 13:36:46,912 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 13:36:46,912 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:36:46,912 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:36:46,912 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:36:46,912 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:36:46,912 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:36:46,912 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 24) no Hoare annotation was computed. [2018-11-10 13:36:46,912 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-11-10 13:36:46,912 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-10 13:36:46,912 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-11-10 13:36:46,913 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 21) the Hoare annotation is: (let ((.cse0 (<= 10 main_~m~0)) (.cse1 (<= 10 main_~n~0))) (or (and (<= 30 main_~k~0) (<= main_~i~0 3) .cse0 .cse1) (and .cse0 (<= 100 main_~k~0) .cse1) (and .cse0 (<= 40 main_~k~0) (<= main_~i~0 4) .cse1) (and .cse0 (<= 0 main_~k~0) (<= main_~i~0 0) .cse1) (and .cse0 (<= 60 main_~k~0) (<= main_~i~0 6) .cse1) (and .cse0 (<= 10 main_~k~0) (<= main_~i~0 1) .cse1) (and (<= 80 main_~k~0) .cse0 (<= main_~i~0 8) .cse1) (and (<= 50 main_~k~0) .cse0 (<= main_~i~0 5) .cse1) (and .cse0 (<= main_~i~0 9) .cse1 (<= 90 main_~k~0)) (and (<= 70 main_~k~0) .cse0 (<= main_~i~0 7) .cse1) (and .cse0 (<= 20 main_~k~0) (<= main_~i~0 2) .cse1))) [2018-11-10 13:36:46,913 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 24) no Hoare annotation was computed. [2018-11-10 13:36:46,913 INFO L421 ceAbstractionStarter]: At program point L17-5(lines 17 21) the Hoare annotation is: (and (<= 10 main_~m~0) (<= 100 main_~k~0) (<= 10 main_~n~0)) [2018-11-10 13:36:46,913 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 24) the Hoare annotation is: true [2018-11-10 13:36:46,913 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 13:36:46,913 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 20) no Hoare annotation was computed. [2018-11-10 13:36:46,913 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-11-10 13:36:46,913 INFO L425 ceAbstractionStarter]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2018-11-10 13:36:46,914 INFO L421 ceAbstractionStarter]: At program point L18-4(lines 18 20) the Hoare annotation is: (let ((.cse27 (<= main_~j~0 4)) (.cse40 (<= main_~j~0 5)) (.cse37 (<= main_~j~0 2)) (.cse25 (<= main_~j~0 6)) (.cse8 (<= main_~j~0 0)) (.cse31 (<= main_~j~0 1)) (.cse30 (<= main_~j~0 9)) (.cse10 (<= main_~j~0 7)) (.cse15 (<= main_~j~0 8)) (.cse4 (<= 10 main_~n~0)) (.cse3 (<= 10 main_~m~0)) (.cse12 (<= main_~j~0 3))) (let ((.cse36 (<= 10 main_~k~0)) (.cse38 (<= 30 main_~k~0)) (.cse16 (<= main_~i~0 0)) (.cse23 (<= 70 main_~k~0)) (.cse14 (and .cse3 .cse12)) (.cse7 (<= 60 main_~k~0)) (.cse35 (<= 90 main_~k~0)) (.cse32 (<= 20 main_~k~0)) (.cse20 (and .cse15 .cse3 .cse4)) (.cse6 (and .cse3 .cse10 .cse4)) (.cse29 (<= 50 main_~k~0)) (.cse18 (and .cse3 .cse30)) (.cse24 (<= main_~i~0 7)) (.cse0 (and .cse3 .cse31 .cse4)) (.cse39 (<= 80 main_~k~0)) (.cse5 (<= main_~i~0 8)) (.cse34 (and .cse3 .cse8 .cse4)) (.cse11 (<= main_~i~0 3)) (.cse26 (and .cse3 .cse4 .cse25)) (.cse19 (and .cse3 .cse37)) (.cse9 (<= main_~i~0 1)) (.cse28 (<= main_~i~0 2)) (.cse13 (<= main_~i~0 5)) (.cse21 (and .cse40 .cse3)) (.cse1 (<= main_~i~0 6)) (.cse2 (<= (+ main_~i~0 1) main_~n~0)) (.cse17 (and .cse3 .cse27)) (.cse33 (<= 40 main_~k~0)) (.cse22 (<= main_~i~0 4))) (or (and .cse0 .cse1 (<= 61 main_~k~0)) (and (<= 100 main_~k~0) (and .cse2 .cse3 .cse4)) (and .cse5 .cse6 (<= 87 main_~k~0)) (and .cse3 .cse7 .cse8 .cse1 .cse4) (and .cse3 .cse9 (<= 17 main_~k~0) .cse10 .cse4) (and (<= 33 main_~k~0) .cse11 .cse3 .cse12 .cse4) (and (<= 53 main_~k~0) .cse13 .cse14 .cse4) (and .cse13 .cse0 (<= 51 main_~k~0)) (and .cse15 .cse3 (<= 8 main_~k~0) .cse16 .cse4) (and (<= 64 main_~k~0) .cse1 .cse4 .cse17) (and (<= 99 main_~k~0) (and .cse2 .cse18 .cse4)) (and (<= 82 main_~k~0) .cse19 .cse5 .cse4) (and (<= 89 main_~k~0) .cse18 .cse5 .cse4) (and (<= 69 main_~k~0) .cse18 .cse1 .cse4) (and .cse3 .cse12 (<= 3 main_~k~0) .cse16 .cse4) (and .cse20 .cse5 (<= 88 main_~k~0)) (and .cse21 (<= 45 main_~k~0) .cse22 .cse4) (and .cse23 .cse3 .cse8 .cse24 .cse4) (and .cse3 (<= 6 main_~k~0) .cse16 .cse4 .cse25) (and (and .cse2 .cse26) (<= 96 main_~k~0)) (and (<= 63 main_~k~0) .cse14 .cse1 .cse4) (and .cse3 (<= 0 main_~k~0) .cse8 .cse16 .cse4) (and .cse11 .cse3 .cse27 (<= 34 main_~k~0) .cse4) (and .cse15 (<= 28 main_~k~0) .cse3 .cse28 .cse4) (and .cse13 (<= 52 main_~k~0) .cse19 .cse4) (and .cse29 .cse22 .cse3 .cse4) (and .cse3 (<= 9 main_~k~0) .cse30 .cse16 .cse4) (and (<= 21 main_~k~0) .cse3 .cse31 .cse28 .cse4) (and .cse22 .cse26 (<= 46 main_~k~0)) (and .cse11 .cse3 (<= 39 main_~k~0) .cse30 .cse4) (and (<= 67 main_~k~0) .cse6 .cse1) (and .cse22 .cse19 (<= 42 main_~k~0) .cse4) (and .cse3 .cse12 .cse9 (<= 13 main_~k~0) .cse4) (and .cse22 (<= 43 main_~k~0) .cse14 .cse4) (and .cse3 .cse32 .cse9 .cse4) (and (<= 97 main_~k~0) (and .cse2 .cse6)) (and .cse11 (<= 32 main_~k~0) .cse19 .cse4) (and (<= 58 main_~k~0) .cse13 .cse20) (and .cse11 .cse3 .cse33 .cse4) (and .cse19 .cse24 (<= 72 main_~k~0) .cse4) (and (and .cse2 .cse34) .cse35) (and .cse3 .cse36 .cse16 .cse4) (and .cse3 .cse31 .cse16 .cse4 (<= 1 main_~k~0)) (and .cse3 (<= 22 main_~k~0) .cse28 .cse37 .cse4) (and (<= 11 main_~k~0) .cse3 .cse31 .cse9 .cse4) (and .cse38 .cse11 .cse3 .cse8 .cse4) (and .cse39 .cse3 .cse24 .cse4) (and .cse40 .cse3 (<= 5 main_~k~0) .cse16 .cse4) (and (<= 75 main_~k~0) .cse21 .cse24 .cse4) (and .cse3 (<= 29 main_~k~0) .cse28 .cse30 .cse4) (and .cse40 .cse3 (<= 25 main_~k~0) .cse28 .cse4) (and .cse3 (<= 26 main_~k~0) .cse28 .cse4 .cse25) (and .cse3 .cse36 .cse9 .cse8 .cse4) (and .cse11 .cse0 (<= 31 main_~k~0)) (and (<= 66 main_~k~0) .cse26 .cse1) (and (<= 83 main_~k~0) .cse5 .cse14 .cse4) (and .cse3 .cse22 .cse27 (<= 44 main_~k~0) .cse4) (and .cse3 (<= 7 main_~k~0) .cse10 .cse16 .cse4) (and .cse22 .cse6 (<= 47 main_~k~0)) (and (<= 2 main_~k~0) .cse3 .cse37 .cse16 .cse4) (and .cse24 .cse14 .cse4 (<= 73 main_~k~0)) (and .cse26 .cse24 (<= 76 main_~k~0)) (and (<= 23 main_~k~0) .cse3 .cse12 .cse28 .cse4) (and (<= 78 main_~k~0) .cse20 .cse24) (and .cse3 .cse22 .cse30 (<= 49 main_~k~0) .cse4) (and .cse3 .cse28 .cse27 .cse4 (<= 24 main_~k~0)) (and (<= 84 main_~k~0) .cse5 .cse4 .cse17) (and .cse38 .cse3 .cse28 .cse4) (and .cse11 .cse3 (<= 36 main_~k~0) .cse4 .cse25) (and .cse3 .cse27 .cse16 (<= 4 main_~k~0) .cse4) (and .cse23 .cse3 .cse1 .cse4) (and (and .cse2 .cse14 .cse4) (<= 93 main_~k~0)) (and (<= 37 main_~k~0) .cse11 .cse3 .cse10 .cse4) (and .cse13 .cse6 (<= 57 main_~k~0)) (and (<= 95 main_~k~0) (and .cse2 .cse21 .cse4)) (and .cse0 (<= 81 main_~k~0) .cse5) (and (<= 68 main_~k~0) .cse20 .cse1) (and .cse7 .cse3 .cse13 .cse4) (and .cse20 .cse22 (<= 48 main_~k~0)) (and (<= 59 main_~k~0) .cse13 .cse18 .cse4) (and .cse5 .cse3 .cse4 .cse35) (and .cse3 .cse9 .cse37 (<= 12 main_~k~0) .cse4) (and .cse11 .cse40 .cse3 (<= 35 main_~k~0) .cse4) (and .cse3 .cse32 .cse28 .cse8 .cse4) (and (and .cse2 .cse20) (<= 98 main_~k~0)) (and .cse6 .cse24 (<= 77 main_~k~0)) (and .cse29 .cse3 .cse13 .cse8 .cse4) (and (<= 85 main_~k~0) .cse21 .cse5 .cse4) (and .cse22 .cse0 (<= 41 main_~k~0)) (and .cse3 .cse9 .cse30 .cse4 (<= 19 main_~k~0)) (and .cse40 .cse3 (<= 15 main_~k~0) .cse9 .cse4) (and .cse18 .cse24 (<= 79 main_~k~0) .cse4) (and (<= 54 main_~k~0) .cse13 .cse4 .cse17) (and (<= 74 main_~k~0) .cse24 .cse4 .cse17) (and .cse0 (<= 71 main_~k~0) .cse24) (and (<= 86 main_~k~0) .cse5 .cse26) (and (and .cse2 .cse19 .cse4) (<= 92 main_~k~0)) (and .cse15 .cse3 (<= 18 main_~k~0) .cse9 .cse4) (and (<= 91 main_~k~0) (and .cse2 .cse0)) (and .cse39 .cse5 .cse34) (and (<= 16 main_~k~0) .cse3 .cse9 .cse4 .cse25) (and .cse11 .cse15 .cse3 (<= 38 main_~k~0) .cse4) (and (<= 56 main_~k~0) .cse26 .cse13) (and .cse19 (<= 62 main_~k~0) .cse1 .cse4) (and (<= 14 main_~k~0) .cse3 .cse9 .cse27 .cse4) (and .cse3 .cse28 .cse10 .cse4 (<= 27 main_~k~0)) (and .cse21 (<= 55 main_~k~0) .cse13 .cse4) (and .cse21 (<= 65 main_~k~0) .cse1 .cse4) (and (and .cse2 .cse4 .cse17) (<= 94 main_~k~0)) (and .cse3 .cse33 .cse22 .cse8 .cse4)))) [2018-11-10 13:36:46,914 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-10 13:36:46,915 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-10 13:36:46,915 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-10 13:36:46,915 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-10 13:36:46,915 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-10 13:36:46,915 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-10 13:36:46,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:36:46 BoogieIcfgContainer [2018-11-10 13:36:46,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:36:46,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:36:46,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:36:46,938 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:36:46,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:34:36" (3/4) ... [2018-11-10 13:36:46,944 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:36:46,948 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:36:46,948 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:36:46,948 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 13:36:46,952 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-10 13:36:46,953 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 13:36:46,953 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 13:36:46,998 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c0d43bc6-d731-458f-8d54-d13aa0276b30/bin-2019/utaipan/witness.graphml [2018-11-10 13:36:46,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:36:47,002 INFO L168 Benchmark]: Toolchain (without parser) took 131008.04 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 960.2 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 13:36:47,003 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:36:47,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.42 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:36:47,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 10.80 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:36:47,004 INFO L168 Benchmark]: Boogie Preprocessor took 12.90 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:36:47,004 INFO L168 Benchmark]: RCFGBuilder took 170.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:36:47,004 INFO L168 Benchmark]: TraceAbstraction took 130571.32 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-10 13:36:47,007 INFO L168 Benchmark]: Witness Printer took 63.08 ms. Allocated memory is still 4.8 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:36:47,009 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.42 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 10.80 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.90 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 170.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 130571.32 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 63.08 ms. Allocated memory is still 4.8 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((30 <= k && i <= 3) && 10 <= m) && 10 <= n) || ((10 <= m && 100 <= k) && 10 <= n)) || (((10 <= m && 40 <= k) && i <= 4) && 10 <= n)) || (((10 <= m && 0 <= k) && i <= 0) && 10 <= n)) || (((10 <= m && 60 <= k) && i <= 6) && 10 <= n)) || (((10 <= m && 10 <= k) && i <= 1) && 10 <= n)) || (((80 <= k && 10 <= m) && i <= 8) && 10 <= n)) || (((50 <= k && 10 <= m) && i <= 5) && 10 <= n)) || (((10 <= m && i <= 9) && 10 <= n) && 90 <= k)) || (((70 <= k && 10 <= m) && i <= 7) && 10 <= n)) || (((10 <= m && 20 <= k) && i <= 2) && 10 <= n) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= m && j <= 1) && 10 <= n) && i <= 6) && 61 <= k) || (100 <= k && (i + 1 <= n && 10 <= m) && 10 <= n)) || ((i <= 8 && (10 <= m && j <= 7) && 10 <= n) && 87 <= k)) || ((((10 <= m && 60 <= k) && j <= 0) && i <= 6) && 10 <= n)) || ((((10 <= m && i <= 1) && 17 <= k) && j <= 7) && 10 <= n)) || ((((33 <= k && i <= 3) && 10 <= m) && j <= 3) && 10 <= n)) || (((53 <= k && i <= 5) && 10 <= m && j <= 3) && 10 <= n)) || ((i <= 5 && (10 <= m && j <= 1) && 10 <= n) && 51 <= k)) || ((((j <= 8 && 10 <= m) && 8 <= k) && i <= 0) && 10 <= n)) || (((64 <= k && i <= 6) && 10 <= n) && 10 <= m && j <= 4)) || (99 <= k && (i + 1 <= n && 10 <= m && j <= 9) && 10 <= n)) || (((82 <= k && 10 <= m && j <= 2) && i <= 8) && 10 <= n)) || (((89 <= k && 10 <= m && j <= 9) && i <= 8) && 10 <= n)) || (((69 <= k && 10 <= m && j <= 9) && i <= 6) && 10 <= n)) || ((((10 <= m && j <= 3) && 3 <= k) && i <= 0) && 10 <= n)) || ((((j <= 8 && 10 <= m) && 10 <= n) && i <= 8) && 88 <= k)) || ((((j <= 5 && 10 <= m) && 45 <= k) && i <= 4) && 10 <= n)) || ((((70 <= k && 10 <= m) && j <= 0) && i <= 7) && 10 <= n)) || ((((10 <= m && 6 <= k) && i <= 0) && 10 <= n) && j <= 6)) || ((i + 1 <= n && (10 <= m && 10 <= n) && j <= 6) && 96 <= k)) || (((63 <= k && 10 <= m && j <= 3) && i <= 6) && 10 <= n)) || ((((10 <= m && 0 <= k) && j <= 0) && i <= 0) && 10 <= n)) || ((((i <= 3 && 10 <= m) && j <= 4) && 34 <= k) && 10 <= n)) || ((((j <= 8 && 28 <= k) && 10 <= m) && i <= 2) && 10 <= n)) || (((i <= 5 && 52 <= k) && 10 <= m && j <= 2) && 10 <= n)) || (((50 <= k && i <= 4) && 10 <= m) && 10 <= n)) || ((((10 <= m && 9 <= k) && j <= 9) && i <= 0) && 10 <= n)) || ((((21 <= k && 10 <= m) && j <= 1) && i <= 2) && 10 <= n)) || ((i <= 4 && (10 <= m && 10 <= n) && j <= 6) && 46 <= k)) || ((((i <= 3 && 10 <= m) && 39 <= k) && j <= 9) && 10 <= n)) || ((67 <= k && (10 <= m && j <= 7) && 10 <= n) && i <= 6)) || (((i <= 4 && 10 <= m && j <= 2) && 42 <= k) && 10 <= n)) || ((((10 <= m && j <= 3) && i <= 1) && 13 <= k) && 10 <= n)) || (((i <= 4 && 43 <= k) && 10 <= m && j <= 3) && 10 <= n)) || (((10 <= m && 20 <= k) && i <= 1) && 10 <= n)) || (97 <= k && i + 1 <= n && (10 <= m && j <= 7) && 10 <= n)) || (((i <= 3 && 32 <= k) && 10 <= m && j <= 2) && 10 <= n)) || ((58 <= k && i <= 5) && (j <= 8 && 10 <= m) && 10 <= n)) || (((i <= 3 && 10 <= m) && 40 <= k) && 10 <= n)) || ((((10 <= m && j <= 2) && i <= 7) && 72 <= k) && 10 <= n)) || ((i + 1 <= n && (10 <= m && j <= 0) && 10 <= n) && 90 <= k)) || (((10 <= m && 10 <= k) && i <= 0) && 10 <= n)) || ((((10 <= m && j <= 1) && i <= 0) && 10 <= n) && 1 <= k)) || ((((10 <= m && 22 <= k) && i <= 2) && j <= 2) && 10 <= n)) || ((((11 <= k && 10 <= m) && j <= 1) && i <= 1) && 10 <= n)) || ((((30 <= k && i <= 3) && 10 <= m) && j <= 0) && 10 <= n)) || (((80 <= k && 10 <= m) && i <= 7) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 5 <= k) && i <= 0) && 10 <= n)) || (((75 <= k && j <= 5 && 10 <= m) && i <= 7) && 10 <= n)) || ((((10 <= m && 29 <= k) && i <= 2) && j <= 9) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 25 <= k) && i <= 2) && 10 <= n)) || ((((10 <= m && 26 <= k) && i <= 2) && 10 <= n) && j <= 6)) || ((((10 <= m && 10 <= k) && i <= 1) && j <= 0) && 10 <= n)) || ((i <= 3 && (10 <= m && j <= 1) && 10 <= n) && 31 <= k)) || ((66 <= k && (10 <= m && 10 <= n) && j <= 6) && i <= 6)) || (((83 <= k && i <= 8) && 10 <= m && j <= 3) && 10 <= n)) || ((((10 <= m && i <= 4) && j <= 4) && 44 <= k) && 10 <= n)) || ((((10 <= m && 7 <= k) && j <= 7) && i <= 0) && 10 <= n)) || ((i <= 4 && (10 <= m && j <= 7) && 10 <= n) && 47 <= k)) || ((((2 <= k && 10 <= m) && j <= 2) && i <= 0) && 10 <= n)) || (((i <= 7 && 10 <= m && j <= 3) && 10 <= n) && 73 <= k)) || ((((10 <= m && 10 <= n) && j <= 6) && i <= 7) && 76 <= k)) || ((((23 <= k && 10 <= m) && j <= 3) && i <= 2) && 10 <= n)) || ((78 <= k && (j <= 8 && 10 <= m) && 10 <= n) && i <= 7)) || ((((10 <= m && i <= 4) && j <= 9) && 49 <= k) && 10 <= n)) || ((((10 <= m && i <= 2) && j <= 4) && 10 <= n) && 24 <= k)) || (((84 <= k && i <= 8) && 10 <= n) && 10 <= m && j <= 4)) || (((30 <= k && 10 <= m) && i <= 2) && 10 <= n)) || ((((i <= 3 && 10 <= m) && 36 <= k) && 10 <= n) && j <= 6)) || ((((10 <= m && j <= 4) && i <= 0) && 4 <= k) && 10 <= n)) || (((70 <= k && 10 <= m) && i <= 6) && 10 <= n)) || (((i + 1 <= n && 10 <= m && j <= 3) && 10 <= n) && 93 <= k)) || ((((37 <= k && i <= 3) && 10 <= m) && j <= 7) && 10 <= n)) || ((i <= 5 && (10 <= m && j <= 7) && 10 <= n) && 57 <= k)) || (95 <= k && (i + 1 <= n && j <= 5 && 10 <= m) && 10 <= n)) || ((((10 <= m && j <= 1) && 10 <= n) && 81 <= k) && i <= 8)) || ((68 <= k && (j <= 8 && 10 <= m) && 10 <= n) && i <= 6)) || (((60 <= k && 10 <= m) && i <= 5) && 10 <= n)) || ((((j <= 8 && 10 <= m) && 10 <= n) && i <= 4) && 48 <= k)) || (((59 <= k && i <= 5) && 10 <= m && j <= 9) && 10 <= n)) || (((i <= 8 && 10 <= m) && 10 <= n) && 90 <= k)) || ((((10 <= m && i <= 1) && j <= 2) && 12 <= k) && 10 <= n)) || ((((i <= 3 && j <= 5) && 10 <= m) && 35 <= k) && 10 <= n)) || ((((10 <= m && 20 <= k) && i <= 2) && j <= 0) && 10 <= n)) || ((i + 1 <= n && (j <= 8 && 10 <= m) && 10 <= n) && 98 <= k)) || ((((10 <= m && j <= 7) && 10 <= n) && i <= 7) && 77 <= k)) || ((((50 <= k && 10 <= m) && i <= 5) && j <= 0) && 10 <= n)) || (((85 <= k && j <= 5 && 10 <= m) && i <= 8) && 10 <= n)) || ((i <= 4 && (10 <= m && j <= 1) && 10 <= n) && 41 <= k)) || ((((10 <= m && i <= 1) && j <= 9) && 10 <= n) && 19 <= k)) || ((((j <= 5 && 10 <= m) && 15 <= k) && i <= 1) && 10 <= n)) || ((((10 <= m && j <= 9) && i <= 7) && 79 <= k) && 10 <= n)) || (((54 <= k && i <= 5) && 10 <= n) && 10 <= m && j <= 4)) || (((74 <= k && i <= 7) && 10 <= n) && 10 <= m && j <= 4)) || ((((10 <= m && j <= 1) && 10 <= n) && 71 <= k) && i <= 7)) || ((86 <= k && i <= 8) && (10 <= m && 10 <= n) && j <= 6)) || (((i + 1 <= n && 10 <= m && j <= 2) && 10 <= n) && 92 <= k)) || ((((j <= 8 && 10 <= m) && 18 <= k) && i <= 1) && 10 <= n)) || (91 <= k && i + 1 <= n && (10 <= m && j <= 1) && 10 <= n)) || ((80 <= k && i <= 8) && (10 <= m && j <= 0) && 10 <= n)) || ((((16 <= k && 10 <= m) && i <= 1) && 10 <= n) && j <= 6)) || ((((i <= 3 && j <= 8) && 10 <= m) && 38 <= k) && 10 <= n)) || ((56 <= k && (10 <= m && 10 <= n) && j <= 6) && i <= 5)) || ((((10 <= m && j <= 2) && 62 <= k) && i <= 6) && 10 <= n)) || ((((14 <= k && 10 <= m) && i <= 1) && j <= 4) && 10 <= n)) || ((((10 <= m && i <= 2) && j <= 7) && 10 <= n) && 27 <= k)) || ((((j <= 5 && 10 <= m) && 55 <= k) && i <= 5) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 65 <= k) && i <= 6) && 10 <= n)) || (((i + 1 <= n && 10 <= n) && 10 <= m && j <= 4) && 94 <= k)) || ((((10 <= m && 40 <= k) && i <= 4) && j <= 0) && 10 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 130.5s OverallTime, 20 OverallIterations, 110 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 118.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 886 SDtfs, 1449 SDslu, 3450 SDs, 0 SdLazy, 1174 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4553 GetRequests, 4066 SyntacticMatches, 60 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3884 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 293 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 27 PreInvPairs, 5144 NumberOfFragments, 1976 HoareAnnotationTreeSize, 27 FomulaSimplifications, 6058176 FormulaSimplificationTreeSizeReduction, 67.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 175756 FormulaSimplificationTreeSizeReductionInter, 51.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 4664 NumberOfCodeBlocks, 4518 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 6741 ConstructedInterpolants, 0 QuantifiedInterpolants, 6960361 SizeOfPredicates, 46 NumberOfNonLiveVariables, 4020 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 52 InterpolantComputations, 4 PerfectInterpolantSequences, 46689/172026 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...